/usr/bin/java -Xmx16000000000 -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-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 08:27:10,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 08:27:10,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 08:27:10,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 08:27:10,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 08:27:10,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 08:27:10,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 08:27:10,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 08:27:10,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 08:27:10,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 08:27:10,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 08:27:10,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 08:27:10,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 08:27:10,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 08:27:10,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 08:27:10,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 08:27:10,762 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 08:27:10,763 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 08:27:10,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 08:27:10,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 08:27:10,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 08:27:10,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 08:27:10,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 08:27:10,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 08:27:10,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 08:27:10,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 08:27:10,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 08:27:10,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 08:27:10,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 08:27:10,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 08:27:10,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 08:27:10,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 08:27:10,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 08:27:10,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 08:27:10,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 08:27:10,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 08:27:10,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 08:27:10,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 08:27:10,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 08:27:10,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 08:27:10,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 08:27:10,784 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-Before.epf [2022-01-19 08:27:10,806 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 08:27:10,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 08:27:10,807 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 08:27:10,807 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 08:27:10,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 08:27:10,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 08:27:10,808 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 08:27:10,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 08:27:10,808 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 08:27:10,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 08:27:10,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 08:27:10,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 08:27:10,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 08:27:10,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 08:27:10,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 08:27:10,809 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 08:27:10,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 08:27:10,809 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 08:27:10,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 08:27:10,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 08:27:10,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 08:27:10,810 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 08:27:10,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 08:27:10,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 08:27:10,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 08:27:10,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 08:27:10,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 08:27:10,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 08:27:10,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 08:27:10,811 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 08:27:10,811 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 08:27:10,811 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 08:27:10,811 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 [2022-01-19 08:27:10,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 08:27:10,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 08:27:10,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 08:27:10,991 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 08:27:10,994 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 08:27:10,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-01-19 08:27:11,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc86cd30d/bd36c11d6d89465b9dde511e6a1a0d25/FLAG74ae12c7f [2022-01-19 08:27:11,365 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 08:27:11,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-01-19 08:27:11,370 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc86cd30d/bd36c11d6d89465b9dde511e6a1a0d25/FLAG74ae12c7f [2022-01-19 08:27:11,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc86cd30d/bd36c11d6d89465b9dde511e6a1a0d25 [2022-01-19 08:27:11,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 08:27:11,380 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 08:27:11,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 08:27:11,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 08:27:11,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 08:27:11,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 08:27:11" (1/1) ... [2022-01-19 08:27:11,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd7967c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:27:11, skipping insertion in model container [2022-01-19 08:27:11,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 08:27:11" (1/1) ... [2022-01-19 08:27:11,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 08:27:11,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 08:27:11,565 WARN L230 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-max-array.wvr.c[2553,2566] [2022-01-19 08:27:11,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 08:27:11,579 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 08:27:11,599 WARN L230 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-max-array.wvr.c[2553,2566] [2022-01-19 08:27:11,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 08:27:11,609 INFO L208 MainTranslator]: Completed translation [2022-01-19 08:27:11,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:27:11 WrapperNode [2022-01-19 08:27:11,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 08:27:11,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 08:27:11,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 08:27:11,611 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 08:27:11,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:27:11" (1/1) ... [2022-01-19 08:27:11,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:27:11" (1/1) ... [2022-01-19 08:27:11,641 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-01-19 08:27:11,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 08:27:11,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 08:27:11,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 08:27:11,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 08:27:11,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:27:11" (1/1) ... [2022-01-19 08:27:11,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:27:11" (1/1) ... [2022-01-19 08:27:11,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:27:11" (1/1) ... [2022-01-19 08:27:11,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:27:11" (1/1) ... [2022-01-19 08:27:11,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:27:11" (1/1) ... [2022-01-19 08:27:11,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:27:11" (1/1) ... [2022-01-19 08:27:11,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:27:11" (1/1) ... [2022-01-19 08:27:11,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 08:27:11,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 08:27:11,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 08:27:11,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 08:27:11,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:27:11" (1/1) ... [2022-01-19 08:27:11,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 08:27:11,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:27:11,705 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-01-19 08:27:11,717 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-01-19 08:27:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 08:27:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 08:27:11,731 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 08:27:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 08:27:11,731 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 08:27:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 08:27:11,731 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 08:27:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 08:27:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 08:27:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 08:27:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 08:27:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 08:27:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 08:27:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 08:27:11,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 08:27:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 08:27:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 08:27:11,733 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 08:27:11,814 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 08:27:11,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 08:27:11,977 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 08:27:12,011 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 08:27:12,011 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 08:27:12,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 08:27:12 BoogieIcfgContainer [2022-01-19 08:27:12,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 08:27:12,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 08:27:12,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 08:27:12,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 08:27:12,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 08:27:11" (1/3) ... [2022-01-19 08:27:12,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c0e6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 08:27:12, skipping insertion in model container [2022-01-19 08:27:12,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:27:11" (2/3) ... [2022-01-19 08:27:12,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c0e6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 08:27:12, skipping insertion in model container [2022-01-19 08:27:12,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 08:27:12" (3/3) ... [2022-01-19 08:27:12,018 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2022-01-19 08:27:12,021 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 08:27:12,022 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 08:27:12,022 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 08:27:12,049 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,049 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,052 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,055 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,056 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,056 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,056 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,057 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,057 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,057 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,058 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,058 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,058 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,058 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,059 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,059 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,059 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,059 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,059 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,059 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,059 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,060 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,060 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,060 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,060 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,060 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,060 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,060 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,061 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,062 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,062 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,062 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,062 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,062 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,062 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,062 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,062 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,063 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,063 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,063 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,063 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,063 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,063 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,064 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,064 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,064 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,064 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,065 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,065 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,065 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,065 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,065 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,065 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,066 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,066 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,066 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,066 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,066 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,066 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,066 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,066 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,066 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,068 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,069 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,069 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,069 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,069 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,069 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,070 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,070 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,070 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,070 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,070 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,070 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,078 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,079 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:27:12,088 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 08:27:12,117 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 08:27:12,121 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 08:27:12,122 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 08:27:12,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 153 transitions, 330 flow [2022-01-19 08:27:12,166 INFO L129 PetriNetUnfolder]: 12/150 cut-off events. [2022-01-19 08:27:12,167 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 08:27:12,170 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 12/150 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2022-01-19 08:27:12,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 153 transitions, 330 flow [2022-01-19 08:27:12,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 139 transitions, 296 flow [2022-01-19 08:27:12,192 INFO L129 PetriNetUnfolder]: 12/138 cut-off events. [2022-01-19 08:27:12,192 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 08:27:12,192 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:27:12,193 INFO L254 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] [2022-01-19 08:27:12,193 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 08:27:12,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:27:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash -977644638, now seen corresponding path program 1 times [2022-01-19 08:27:12,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:27:12,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817212826] [2022-01-19 08:27:12,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:27:12,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:27:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:27:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:27:12,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:27:12,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817212826] [2022-01-19 08:27:12,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817212826] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:27:12,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:27:12,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 08:27:12,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364845453] [2022-01-19 08:27:12,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:27:12,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 08:27:12,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:27:12,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 08:27:12,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 08:27:12,393 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 153 [2022-01-19 08:27:12,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 139 transitions, 296 flow. Second operand has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 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-01-19 08:27:12,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:27:12,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 153 [2022-01-19 08:27:12,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:27:12,490 INFO L129 PetriNetUnfolder]: 41/264 cut-off events. [2022-01-19 08:27:12,491 INFO L130 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-01-19 08:27:12,492 INFO L84 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 264 events. 41/264 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 695 event pairs, 15 based on Foata normal form. 42/275 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-01-19 08:27:12,494 INFO L132 encePairwiseOnDemand]: 145/153 looper letters, 9 selfloop transitions, 0 changer transitions 4/131 dead transitions. [2022-01-19 08:27:12,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 298 flow [2022-01-19 08:27:12,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 08:27:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 08:27:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2022-01-19 08:27:12,517 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9379084967320261 [2022-01-19 08:27:12,517 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2022-01-19 08:27:12,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2022-01-19 08:27:12,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:27:12,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2022-01-19 08:27:12,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 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-01-19 08:27:12,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 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-01-19 08:27:12,531 INFO L81 ComplementDD]: Finished complementDD. Result 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-01-19 08:27:12,532 INFO L186 Difference]: Start difference. First operand has 137 places, 139 transitions, 296 flow. Second operand 2 states and 287 transitions. [2022-01-19 08:27:12,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 298 flow [2022-01-19 08:27:12,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 286 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 08:27:12,544 INFO L242 Difference]: Finished difference. Result has 132 places, 127 transitions, 260 flow [2022-01-19 08:27:12,545 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=260, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2022-01-19 08:27:12,549 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, -5 predicate places. [2022-01-19 08:27:12,549 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 260 flow [2022-01-19 08:27:12,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 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-01-19 08:27:12,550 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:27:12,550 INFO L254 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] [2022-01-19 08:27:12,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 08:27:12,551 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 08:27:12,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:27:12,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1446866490, now seen corresponding path program 1 times [2022-01-19 08:27:12,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:27:12,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538643496] [2022-01-19 08:27:12,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:27:12,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:27:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:27:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:27:12,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:27:12,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538643496] [2022-01-19 08:27:12,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538643496] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:27:12,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:27:12,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 08:27:12,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972002858] [2022-01-19 08:27:12,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:27:12,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 08:27:12,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:27:12,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 08:27:12,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-01-19 08:27:12,871 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 153 [2022-01-19 08:27:12,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 260 flow. Second operand has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 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-01-19 08:27:12,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:27:12,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 153 [2022-01-19 08:27:12,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:27:13,071 INFO L129 PetriNetUnfolder]: 295/678 cut-off events. [2022-01-19 08:27:13,071 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-01-19 08:27:13,074 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 678 events. 295/678 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2975 event pairs, 167 based on Foata normal form. 1/510 useless extension candidates. Maximal degree in co-relation 1134. Up to 421 conditions per place. [2022-01-19 08:27:13,079 INFO L132 encePairwiseOnDemand]: 143/153 looper letters, 44 selfloop transitions, 6 changer transitions 4/135 dead transitions. [2022-01-19 08:27:13,079 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 135 transitions, 384 flow [2022-01-19 08:27:13,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 08:27:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 08:27:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 807 transitions. [2022-01-19 08:27:13,082 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6593137254901961 [2022-01-19 08:27:13,082 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 807 transitions. [2022-01-19 08:27:13,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 807 transitions. [2022-01-19 08:27:13,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:27:13,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 807 transitions. [2022-01-19 08:27:13,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 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-01-19 08:27:13,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 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-01-19 08:27:13,089 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 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-01-19 08:27:13,089 INFO L186 Difference]: Start difference. First operand has 132 places, 127 transitions, 260 flow. Second operand 8 states and 807 transitions. [2022-01-19 08:27:13,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 135 transitions, 384 flow [2022-01-19 08:27:13,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 08:27:13,093 INFO L242 Difference]: Finished difference. Result has 139 places, 128 transitions, 288 flow [2022-01-19 08:27:13,093 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=288, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2022-01-19 08:27:13,094 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2022-01-19 08:27:13,095 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 288 flow [2022-01-19 08:27:13,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 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-01-19 08:27:13,097 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:27:13,101 INFO L254 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] [2022-01-19 08:27:13,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 08:27:13,102 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 08:27:13,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:27:13,103 INFO L85 PathProgramCache]: Analyzing trace with hash -312552496, now seen corresponding path program 1 times [2022-01-19 08:27:13,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:27:13,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111001427] [2022-01-19 08:27:13,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:27:13,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:27:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:27:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:27:13,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:27:13,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111001427] [2022-01-19 08:27:13,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111001427] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:27:13,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797471156] [2022-01-19 08:27:13,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:27:13,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:27:13,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:27:13,232 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-01-19 08:27:13,284 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-01-19 08:27:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:27:13,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 08:27:13,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:27:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:27:13,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:27:13,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:27:13,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797471156] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 08:27:13,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 08:27:13,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-19 08:27:13,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103035227] [2022-01-19 08:27:13,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:27:13,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 08:27:13,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:27:13,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 08:27:13,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-19 08:27:13,812 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 153 [2022-01-19 08:27:13,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 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-01-19 08:27:13,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:27:13,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 153 [2022-01-19 08:27:13,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:27:13,916 INFO L129 PetriNetUnfolder]: 175/510 cut-off events. [2022-01-19 08:27:13,916 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-01-19 08:27:13,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 510 events. 175/510 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2082 event pairs, 45 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 826. Up to 137 conditions per place. [2022-01-19 08:27:13,920 INFO L132 encePairwiseOnDemand]: 145/153 looper letters, 33 selfloop transitions, 7 changer transitions 0/136 dead transitions. [2022-01-19 08:27:13,920 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 136 transitions, 386 flow [2022-01-19 08:27:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 08:27:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 08:27:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2022-01-19 08:27:13,922 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7759103641456583 [2022-01-19 08:27:13,922 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2022-01-19 08:27:13,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2022-01-19 08:27:13,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:27:13,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2022-01-19 08:27:13,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 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-01-19 08:27:13,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 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-01-19 08:27:13,927 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 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-01-19 08:27:13,927 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 288 flow. Second operand 7 states and 831 transitions. [2022-01-19 08:27:13,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 136 transitions, 386 flow [2022-01-19 08:27:13,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 368 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-01-19 08:27:13,930 INFO L242 Difference]: Finished difference. Result has 139 places, 130 transitions, 303 flow [2022-01-19 08:27:13,930 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=303, PETRI_PLACES=139, PETRI_TRANSITIONS=130} [2022-01-19 08:27:13,930 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2022-01-19 08:27:13,930 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 130 transitions, 303 flow [2022-01-19 08:27:13,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 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-01-19 08:27:13,931 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:27:13,931 INFO L254 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-01-19 08:27:13,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 08:27:14,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:27:14,148 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 08:27:14,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:27:14,149 INFO L85 PathProgramCache]: Analyzing trace with hash -505819659, now seen corresponding path program 1 times [2022-01-19 08:27:14,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:27:14,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133748912] [2022-01-19 08:27:14,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:27:14,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:27:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:27:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:27:14,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:27:14,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133748912] [2022-01-19 08:27:14,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133748912] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:27:14,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268753476] [2022-01-19 08:27:14,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:27:14,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:27:14,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:27:14,230 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-01-19 08:27:14,231 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-01-19 08:27:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:27:14,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 08:27:14,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:27:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:27:14,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:27:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:27:14,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268753476] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 08:27:14,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 08:27:14,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-01-19 08:27:14,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541398667] [2022-01-19 08:27:14,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:27:14,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 08:27:14,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:27:14,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 08:27:14,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-01-19 08:27:14,736 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2022-01-19 08:27:14,737 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 130 transitions, 303 flow. Second operand has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 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-01-19 08:27:14,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:27:14,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2022-01-19 08:27:14,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:27:14,956 INFO L129 PetriNetUnfolder]: 599/1273 cut-off events. [2022-01-19 08:27:14,956 INFO L130 PetriNetUnfolder]: For 404/585 co-relation queries the response was YES. [2022-01-19 08:27:14,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2530 conditions, 1273 events. 599/1273 cut-off events. For 404/585 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6934 event pairs, 124 based on Foata normal form. 181/1303 useless extension candidates. Maximal degree in co-relation 2522. Up to 249 conditions per place. [2022-01-19 08:27:14,963 INFO L132 encePairwiseOnDemand]: 141/153 looper letters, 74 selfloop transitions, 19 changer transitions 0/182 dead transitions. [2022-01-19 08:27:14,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 182 transitions, 642 flow [2022-01-19 08:27:14,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 08:27:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 08:27:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1253 transitions. [2022-01-19 08:27:14,965 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.744503862150921 [2022-01-19 08:27:14,965 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1253 transitions. [2022-01-19 08:27:14,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1253 transitions. [2022-01-19 08:27:14,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:27:14,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1253 transitions. [2022-01-19 08:27:14,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 113.9090909090909) internal successors, (1253), 11 states have internal predecessors, (1253), 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-01-19 08:27:14,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 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-01-19 08:27:14,970 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 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-01-19 08:27:14,970 INFO L186 Difference]: Start difference. First operand has 139 places, 130 transitions, 303 flow. Second operand 11 states and 1253 transitions. [2022-01-19 08:27:14,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 182 transitions, 642 flow [2022-01-19 08:27:14,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 182 transitions, 629 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 08:27:14,973 INFO L242 Difference]: Finished difference. Result has 151 places, 142 transitions, 402 flow [2022-01-19 08:27:14,974 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=402, PETRI_PLACES=151, PETRI_TRANSITIONS=142} [2022-01-19 08:27:14,974 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 14 predicate places. [2022-01-19 08:27:14,974 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 142 transitions, 402 flow [2022-01-19 08:27:14,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 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-01-19 08:27:14,975 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:27:14,975 INFO L254 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-01-19 08:27:14,991 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-01-19 08:27:15,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-19 08:27:15,192 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 08:27:15,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:27:15,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1014903075, now seen corresponding path program 2 times [2022-01-19 08:27:15,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:27:15,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477002508] [2022-01-19 08:27:15,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:27:15,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:27:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:27:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:27:15,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:27:15,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477002508] [2022-01-19 08:27:15,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477002508] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:27:15,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149290150] [2022-01-19 08:27:15,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 08:27:15,287 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:27:15,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:27:15,288 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-01-19 08:27:15,289 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-01-19 08:27:15,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 08:27:15,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:27:15,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 08:27:15,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:27:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:27:15,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 08:27:15,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149290150] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:27:15,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 08:27:15,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-01-19 08:27:15,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261684465] [2022-01-19 08:27:15,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:27:15,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 08:27:15,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:27:15,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 08:27:15,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-01-19 08:27:15,621 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 153 [2022-01-19 08:27:15,622 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 142 transitions, 402 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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-01-19 08:27:15,622 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:27:15,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 153 [2022-01-19 08:27:15,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:27:15,787 INFO L129 PetriNetUnfolder]: 413/833 cut-off events. [2022-01-19 08:27:15,788 INFO L130 PetriNetUnfolder]: For 772/877 co-relation queries the response was YES. [2022-01-19 08:27:15,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 833 events. 413/833 cut-off events. For 772/877 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3682 event pairs, 111 based on Foata normal form. 131/942 useless extension candidates. Maximal degree in co-relation 2149. Up to 334 conditions per place. [2022-01-19 08:27:15,793 INFO L132 encePairwiseOnDemand]: 144/153 looper letters, 42 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2022-01-19 08:27:15,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 144 transitions, 501 flow [2022-01-19 08:27:15,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 08:27:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 08:27:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 857 transitions. [2022-01-19 08:27:15,795 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7001633986928104 [2022-01-19 08:27:15,795 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 857 transitions. [2022-01-19 08:27:15,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 857 transitions. [2022-01-19 08:27:15,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:27:15,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 857 transitions. [2022-01-19 08:27:15,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 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-01-19 08:27:15,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 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-01-19 08:27:15,799 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 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-01-19 08:27:15,799 INFO L186 Difference]: Start difference. First operand has 151 places, 142 transitions, 402 flow. Second operand 8 states and 857 transitions. [2022-01-19 08:27:15,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 144 transitions, 501 flow [2022-01-19 08:27:15,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 144 transitions, 488 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-01-19 08:27:15,803 INFO L242 Difference]: Finished difference. Result has 150 places, 136 transitions, 379 flow [2022-01-19 08:27:15,803 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=379, PETRI_PLACES=150, PETRI_TRANSITIONS=136} [2022-01-19 08:27:15,804 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 13 predicate places. [2022-01-19 08:27:15,804 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 136 transitions, 379 flow [2022-01-19 08:27:15,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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-01-19 08:27:15,804 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:27:15,804 INFO L254 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] [2022-01-19 08:27:15,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 08:27:16,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:27:16,021 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 08:27:16,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:27:16,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1225204200, now seen corresponding path program 1 times [2022-01-19 08:27:16,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:27:16,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379711012] [2022-01-19 08:27:16,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:27:16,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:27:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:27:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:27:16,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:27:16,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379711012] [2022-01-19 08:27:16,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379711012] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:27:16,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443936506] [2022-01-19 08:27:16,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:27:16,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:27:16,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:27:16,555 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:27:16,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 08:27:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:27:16,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-19 08:27:16,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:27:17,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 08:27:17,942 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:27:17,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 36 [2022-01-19 08:27:18,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:27:18,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:27:18,380 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:27:18,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 55 [2022-01-19 08:27:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:27:19,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443936506] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 08:27:19,121 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 08:27:19,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 18] total 56 [2022-01-19 08:27:19,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591991859] [2022-01-19 08:27:19,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 08:27:19,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-19 08:27:19,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:27:19,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-19 08:27:19,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=2691, Unknown=0, NotChecked=0, Total=3080 [2022-01-19 08:27:19,126 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2022-01-19 08:27:19,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 136 transitions, 379 flow. Second operand has 56 states, 56 states have (on average 68.39285714285714) internal successors, (3830), 56 states have internal predecessors, (3830), 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-01-19 08:27:19,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:27:19,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2022-01-19 08:27:19,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:27:23,327 INFO L129 PetriNetUnfolder]: 7004/11453 cut-off events. [2022-01-19 08:27:23,328 INFO L130 PetriNetUnfolder]: For 9233/9233 co-relation queries the response was YES. [2022-01-19 08:27:23,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29290 conditions, 11453 events. 7004/11453 cut-off events. For 9233/9233 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 79516 event pairs, 711 based on Foata normal form. 84/11378 useless extension candidates. Maximal degree in co-relation 29278. Up to 3532 conditions per place. [2022-01-19 08:27:23,402 INFO L132 encePairwiseOnDemand]: 110/153 looper letters, 431 selfloop transitions, 193 changer transitions 13/689 dead transitions. [2022-01-19 08:27:23,403 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 689 transitions, 3573 flow [2022-01-19 08:27:23,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-01-19 08:27:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2022-01-19 08:27:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 5413 transitions. [2022-01-19 08:27:23,413 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.47809574280162515 [2022-01-19 08:27:23,413 INFO L72 ComplementDD]: Start complementDD. Operand 74 states and 5413 transitions. [2022-01-19 08:27:23,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 5413 transitions. [2022-01-19 08:27:23,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:27:23,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 5413 transitions. [2022-01-19 08:27:23,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 75 states, 74 states have (on average 73.14864864864865) internal successors, (5413), 74 states have internal predecessors, (5413), 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-01-19 08:27:23,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 75 states, 75 states have (on average 153.0) internal successors, (11475), 75 states have internal predecessors, (11475), 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-01-19 08:27:23,438 INFO L81 ComplementDD]: Finished complementDD. Result has 75 states, 75 states have (on average 153.0) internal successors, (11475), 75 states have internal predecessors, (11475), 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-01-19 08:27:23,438 INFO L186 Difference]: Start difference. First operand has 150 places, 136 transitions, 379 flow. Second operand 74 states and 5413 transitions. [2022-01-19 08:27:23,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 689 transitions, 3573 flow [2022-01-19 08:27:23,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 689 transitions, 3509 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-01-19 08:27:23,500 INFO L242 Difference]: Finished difference. Result has 262 places, 325 transitions, 1831 flow [2022-01-19 08:27:23,501 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=74, PETRI_FLOW=1831, PETRI_PLACES=262, PETRI_TRANSITIONS=325} [2022-01-19 08:27:23,501 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 125 predicate places. [2022-01-19 08:27:23,501 INFO L470 AbstractCegarLoop]: Abstraction has has 262 places, 325 transitions, 1831 flow [2022-01-19 08:27:23,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 68.39285714285714) internal successors, (3830), 56 states have internal predecessors, (3830), 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-01-19 08:27:23,502 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:27:23,503 INFO L254 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] [2022-01-19 08:27:23,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 08:27:23,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:27:23,707 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 08:27:23,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:27:23,707 INFO L85 PathProgramCache]: Analyzing trace with hash 513619604, now seen corresponding path program 2 times [2022-01-19 08:27:23,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:27:23,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035331344] [2022-01-19 08:27:23,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:27:23,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:27:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:27:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:27:24,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:27:24,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035331344] [2022-01-19 08:27:24,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035331344] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:27:24,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247804405] [2022-01-19 08:27:24,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 08:27:24,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:27:24,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:27:24,183 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:27:24,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 08:27:24,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 08:27:24,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:27:24,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-19 08:27:24,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:27:24,801 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:27:24,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 45 [2022-01-19 08:27:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:27:25,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:27:25,557 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:27:25,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 55 [2022-01-19 08:27:26,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:27:26,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247804405] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 08:27:26,027 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 08:27:26,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16, 15] total 42 [2022-01-19 08:27:26,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217049602] [2022-01-19 08:27:26,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 08:27:26,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-19 08:27:26,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:27:26,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-19 08:27:26,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1438, Unknown=0, NotChecked=0, Total=1722 [2022-01-19 08:27:26,030 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 153 [2022-01-19 08:27:26,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 325 transitions, 1831 flow. Second operand has 42 states, 42 states have (on average 70.28571428571429) internal successors, (2952), 42 states have internal predecessors, (2952), 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-01-19 08:27:26,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:27:26,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 153 [2022-01-19 08:27:26,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:27:30,281 INFO L129 PetriNetUnfolder]: 7974/13195 cut-off events. [2022-01-19 08:27:30,281 INFO L130 PetriNetUnfolder]: For 84287/84676 co-relation queries the response was YES. [2022-01-19 08:27:30,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54371 conditions, 13195 events. 7974/13195 cut-off events. For 84287/84676 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 96243 event pairs, 1643 based on Foata normal form. 45/13074 useless extension candidates. Maximal degree in co-relation 54316. Up to 7387 conditions per place. [2022-01-19 08:27:30,398 INFO L132 encePairwiseOnDemand]: 122/153 looper letters, 373 selfloop transitions, 165 changer transitions 19/611 dead transitions. [2022-01-19 08:27:30,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 611 transitions, 4700 flow [2022-01-19 08:27:30,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-19 08:27:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-01-19 08:27:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 3226 transitions. [2022-01-19 08:27:30,402 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4792038027332145 [2022-01-19 08:27:30,402 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 3226 transitions. [2022-01-19 08:27:30,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 3226 transitions. [2022-01-19 08:27:30,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:27:30,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 3226 transitions. [2022-01-19 08:27:30,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 73.31818181818181) internal successors, (3226), 44 states have internal predecessors, (3226), 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-01-19 08:27:30,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 153.0) internal successors, (6885), 45 states have internal predecessors, (6885), 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-01-19 08:27:30,414 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 153.0) internal successors, (6885), 45 states have internal predecessors, (6885), 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-01-19 08:27:30,414 INFO L186 Difference]: Start difference. First operand has 262 places, 325 transitions, 1831 flow. Second operand 44 states and 3226 transitions. [2022-01-19 08:27:30,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 611 transitions, 4700 flow [2022-01-19 08:27:30,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 611 transitions, 4628 flow, removed 20 selfloop flow, removed 17 redundant places. [2022-01-19 08:27:30,750 INFO L242 Difference]: Finished difference. Result has 307 places, 416 transitions, 3071 flow [2022-01-19 08:27:30,750 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1775, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=3071, PETRI_PLACES=307, PETRI_TRANSITIONS=416} [2022-01-19 08:27:30,751 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 170 predicate places. [2022-01-19 08:27:30,753 INFO L470 AbstractCegarLoop]: Abstraction has has 307 places, 416 transitions, 3071 flow [2022-01-19 08:27:30,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 70.28571428571429) internal successors, (2952), 42 states have internal predecessors, (2952), 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-01-19 08:27:30,763 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:27:30,763 INFO L254 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] [2022-01-19 08:27:30,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 08:27:30,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:27:30,979 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 08:27:30,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:27:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1183853158, now seen corresponding path program 3 times [2022-01-19 08:27:30,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:27:30,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827882539] [2022-01-19 08:27:30,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:27:30,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:27:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:27:31,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:27:31,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:27:31,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827882539] [2022-01-19 08:27:31,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827882539] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:27:31,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590733836] [2022-01-19 08:27:31,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 08:27:31,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:27:31,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:27:31,601 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:27:31,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 08:27:31,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 08:27:31,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:27:31,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-19 08:27:31,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:27:32,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-01-19 08:27:32,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 08:27:32,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 08:27:32,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 08:27:33,251 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:27:33,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 45 [2022-01-19 08:27:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:27:33,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:27:34,758 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (let ((.cse0 (select .cse3 c_~A~0.offset))) (or (not (< c_~max1~0 .cse0)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse1 (< c_~max2~0 .cse2))) (and (or (= c_~max2~0 .cse0) .cse1) (or (not .cse1) (= .cse2 .cse0))))))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (or (let ((.cse4 (select .cse6 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse5 (< c_~max2~0 .cse4))) (and (or (= c_~max1~0 .cse4) (not .cse5)) (or (= c_~max1~0 c_~max2~0) .cse5)))) (< c_~max1~0 (select .cse6 c_~A~0.offset)))))) (<= (+ 2 c_~M~0) c_~N~0) (not (< c_~M~0 c_~N~0))) is different from false [2022-01-19 08:27:37,623 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< 0 ~M~0) (and (forall ((v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (or (let ((.cse0 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse1 (< c_~max2~0 .cse0))) (and (or (= c_~max1~0 .cse0) (not .cse1)) (or (= c_~max1~0 c_~max2~0) .cse1)))) (< c_~max1~0 (select .cse2 c_~A~0.offset))))) (forall ((v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (let ((.cse3 (select .cse6 c_~A~0.offset))) (or (not (< c_~max1~0 .cse3)) (let ((.cse4 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse5 (< c_~max2~0 .cse4))) (and (or (= .cse3 .cse4) (not .cse5)) (or (= .cse3 c_~max2~0) .cse5))))))))))) is different from false [2022-01-19 08:27:40,131 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< 0 ~M~0) (and (forall ((v_ArrVal_223 (Array Int Int)) (v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_223) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (or (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse0 (< c_~max2~0 .cse1))) (and (or (not .cse0) (= c_~max1~0 .cse1)) (or .cse0 (= c_~max1~0 c_~max2~0))))) (< c_~max1~0 (select .cse2 c_~A~0.offset))))) (forall ((v_ArrVal_223 (Array Int Int)) (v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_223) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (let ((.cse3 (select .cse6 c_~A~0.offset))) (or (not (< c_~max1~0 .cse3)) (let ((.cse5 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse4 (< c_~max2~0 .cse5))) (and (or (not .cse4) (= .cse3 .cse5)) (or .cse4 (= .cse3 c_~max2~0)))))))))))) is different from false [2022-01-19 08:27:47,811 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:27:47,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 316 treesize of output 209 [2022-01-19 08:27:47,836 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:27:47,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2593 treesize of output 2497 [2022-01-19 08:27:47,876 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:27:47,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2452 treesize of output 2385 [2022-01-19 08:27:47,905 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:27:47,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2372 treesize of output 2225 [2022-01-19 08:27:47,934 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:27:47,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2212 treesize of output 2185 [2022-01-19 08:27:47,966 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:27:47,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2172 treesize of output 2089 [2022-01-19 08:27:47,997 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:27:47,998 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2076 treesize of output 1897 [2022-01-19 08:27:48,031 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:27:48,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1884 treesize of output 1849 [2022-01-19 08:27:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:27:51,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590733836] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 08:27:51,174 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 08:27:51,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31, 26] total 69 [2022-01-19 08:27:51,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753190901] [2022-01-19 08:27:51,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 08:27:51,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-01-19 08:27:51,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:27:51,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-01-19 08:27:51,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=3602, Unknown=66, NotChecked=390, Total=4692 [2022-01-19 08:27:51,178 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 153 [2022-01-19 08:27:51,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 416 transitions, 3071 flow. Second operand has 69 states, 69 states have (on average 57.85507246376812) internal successors, (3992), 69 states have internal predecessors, (3992), 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-01-19 08:27:51,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:27:51,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 153 [2022-01-19 08:27:51,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:27:59,940 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~max2~0 0)) (.cse2 (< 0 c_~max2~0)) (.cse0 (= c_~max1~0 0)) (.cse3 (= c_~max1~0 c_~max2~0))) (and (or (and .cse0 .cse1) (and .cse2 .cse3)) (<= 1 c_~N~0) (let ((.cse5 (< 0 c_~max1~0)) (.cse4 (<= c_thread3Thread1of1ForFork1_~i~2 1)) (.cse6 (< c_thread3Thread1of1ForFork1_~i~2 1))) (or (and .cse1 (or (and .cse0 .cse4) (and .cse5 .cse6))) (and .cse2 (or (and .cse5 (or .cse6 (and .cse3 .cse4))) (and .cse0 .cse6))))) (or (and (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (let ((.cse7 (select .cse10 c_~A~0.offset))) (or (not (< c_~max1~0 .cse7)) (let ((.cse9 (select .cse10 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse8 (< c_~max2~0 .cse9))) (and (or (= c_~max2~0 .cse7) .cse8) (or (not .cse8) (= .cse9 .cse7))))))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (or (let ((.cse11 (select .cse13 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse12 (< c_~max2~0 .cse11))) (and (or (= c_~max1~0 .cse11) (not .cse12)) (or (= c_~max1~0 c_~max2~0) .cse12)))) (< c_~max1~0 (select .cse13 c_~A~0.offset)))))) (<= (+ 2 c_~M~0) c_~N~0) (not (< c_~M~0 c_~N~0))) (< 0 c_~N~0) (or .cse3 (<= 2 c_~N~0)) (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (and (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (let ((.cse14 (select .cse17 c_~A~0.offset))) (or (not (< c_~max1~0 .cse14)) (let ((.cse15 (select .cse17 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse16 (< c_~max2~0 .cse15))) (and (or (= .cse15 .cse14) (not .cse16)) (or (= c_~max2~0 .cse14) .cse16)))))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (or (let ((.cse19 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse18 (< c_~max2~0 .cse19))) (and (or (= c_~max1~0 c_~max2~0) .cse18) (or (not .cse18) (= .cse19 c_~max1~0))))) (< c_~max1~0 (select .cse20 c_~A~0.offset)))))) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))) (or (let ((.cse26 (select |c_#memory_int| c_~A~0.base))) (let ((.cse23 (select .cse26 (+ c_~A~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4))))) (let ((.cse25 (select .cse26 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (.cse21 (< c_~max2~0 .cse23))) (let ((.cse22 (not .cse21)) (.cse24 (< c_~max1~0 .cse25))) (and (or (and (or .cse3 .cse21) (or .cse22 (= c_~max1~0 .cse23))) .cse24) (or (and (or .cse22 (= .cse25 .cse23)) (or .cse21 (= .cse25 c_~max2~0))) (not .cse24))))))) (<= (+ 2 c_thread3Thread1of1ForFork1_~i~2) c_~N~0) (not (< c_thread3Thread1of1ForFork1_~i~2 c_~N~0))))) is different from false [2022-01-19 08:28:03,739 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~max2~0 0)) (.cse2 (< 0 c_~max2~0)) (.cse0 (= c_~max1~0 0)) (.cse3 (= c_~max1~0 c_~max2~0))) (and (or (and .cse0 .cse1) (and .cse2 .cse3)) (<= 1 c_~N~0) (let ((.cse5 (< 0 c_~max1~0)) (.cse4 (<= c_thread3Thread1of1ForFork1_~i~2 1)) (.cse6 (< c_thread3Thread1of1ForFork1_~i~2 1))) (or (and .cse1 (or (and .cse0 .cse4) (and .cse5 .cse6))) (and .cse2 (or (and .cse5 (or .cse6 (and .cse3 .cse4))) (and .cse0 .cse6))))) (< 0 c_~N~0) (or .cse3 (<= 2 c_~N~0)) (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (and (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (let ((.cse7 (select .cse10 c_~A~0.offset))) (or (not (< c_~max1~0 .cse7)) (let ((.cse8 (select .cse10 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse9 (< c_~max2~0 .cse8))) (and (or (= .cse8 .cse7) (not .cse9)) (or (= c_~max2~0 .cse7) .cse9)))))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (or (let ((.cse12 (select .cse13 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse11 (< c_~max2~0 .cse12))) (and (or (= c_~max1~0 c_~max2~0) .cse11) (or (not .cse11) (= .cse12 c_~max1~0))))) (< c_~max1~0 (select .cse13 c_~A~0.offset)))))) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))) is different from false [2022-01-19 08:28:04,008 INFO L129 PetriNetUnfolder]: 10977/18712 cut-off events. [2022-01-19 08:28:04,008 INFO L130 PetriNetUnfolder]: For 151790/152126 co-relation queries the response was YES. [2022-01-19 08:28:04,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86377 conditions, 18712 events. 10977/18712 cut-off events. For 151790/152126 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 148364 event pairs, 2333 based on Foata normal form. 46/18537 useless extension candidates. Maximal degree in co-relation 86303. Up to 7863 conditions per place. [2022-01-19 08:28:04,234 INFO L132 encePairwiseOnDemand]: 106/153 looper letters, 556 selfloop transitions, 391 changer transitions 28/1023 dead transitions. [2022-01-19 08:28:04,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 1023 transitions, 10299 flow [2022-01-19 08:28:04,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-01-19 08:28:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2022-01-19 08:28:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 5355 transitions. [2022-01-19 08:28:04,241 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4069767441860465 [2022-01-19 08:28:04,241 INFO L72 ComplementDD]: Start complementDD. Operand 86 states and 5355 transitions. [2022-01-19 08:28:04,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 5355 transitions. [2022-01-19 08:28:04,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:28:04,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 86 states and 5355 transitions. [2022-01-19 08:28:04,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 87 states, 86 states have (on average 62.26744186046512) internal successors, (5355), 86 states have internal predecessors, (5355), 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-01-19 08:28:04,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 87 states, 87 states have (on average 153.0) internal successors, (13311), 87 states have internal predecessors, (13311), 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-01-19 08:28:04,262 INFO L81 ComplementDD]: Finished complementDD. Result has 87 states, 87 states have (on average 153.0) internal successors, (13311), 87 states have internal predecessors, (13311), 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-01-19 08:28:04,262 INFO L186 Difference]: Start difference. First operand has 307 places, 416 transitions, 3071 flow. Second operand 86 states and 5355 transitions. [2022-01-19 08:28:04,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 1023 transitions, 10299 flow [2022-01-19 08:28:04,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 1023 transitions, 10068 flow, removed 86 selfloop flow, removed 19 redundant places. [2022-01-19 08:28:04,934 INFO L242 Difference]: Finished difference. Result has 415 places, 656 transitions, 6947 flow [2022-01-19 08:28:04,934 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2966, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=6947, PETRI_PLACES=415, PETRI_TRANSITIONS=656} [2022-01-19 08:28:04,934 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 278 predicate places. [2022-01-19 08:28:04,935 INFO L470 AbstractCegarLoop]: Abstraction has has 415 places, 656 transitions, 6947 flow [2022-01-19 08:28:04,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 57.85507246376812) internal successors, (3992), 69 states have internal predecessors, (3992), 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-01-19 08:28:04,936 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:28:04,936 INFO L254 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] [2022-01-19 08:28:04,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 08:28:05,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:28:05,152 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 08:28:05,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:28:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash 83737512, now seen corresponding path program 4 times [2022-01-19 08:28:05,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:28:05,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45397464] [2022-01-19 08:28:05,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:28:05,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:28:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:28:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:28:05,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:28:05,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45397464] [2022-01-19 08:28:05,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45397464] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:28:05,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102664579] [2022-01-19 08:28:05,699 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 08:28:05,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:28:05,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:28:05,700 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:28:05,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 08:28:05,767 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 08:28:05,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:28:05,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-19 08:28:05,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:28:06,630 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 08:28:06,630 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 36 [2022-01-19 08:28:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:28:06,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:28:06,943 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:28:06,944 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 55 [2022-01-19 08:28:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:28:07,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102664579] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 08:28:07,611 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 08:28:07,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 18] total 52 [2022-01-19 08:28:07,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280247772] [2022-01-19 08:28:07,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 08:28:07,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-01-19 08:28:07,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:28:07,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-01-19 08:28:07,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=2240, Unknown=0, NotChecked=0, Total=2652 [2022-01-19 08:28:07,617 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 153 [2022-01-19 08:28:07,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 656 transitions, 6947 flow. Second operand has 52 states, 52 states have (on average 71.61538461538461) internal successors, (3724), 52 states have internal predecessors, (3724), 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-01-19 08:28:07,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:28:07,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 153 [2022-01-19 08:28:07,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:28:14,288 INFO L129 PetriNetUnfolder]: 11974/21201 cut-off events. [2022-01-19 08:28:14,288 INFO L130 PetriNetUnfolder]: For 332724/333396 co-relation queries the response was YES. [2022-01-19 08:28:14,511 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128670 conditions, 21201 events. 11974/21201 cut-off events. For 332724/333396 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 181123 event pairs, 1954 based on Foata normal form. 184/21106 useless extension candidates. Maximal degree in co-relation 128554. Up to 9378 conditions per place. [2022-01-19 08:28:14,611 INFO L132 encePairwiseOnDemand]: 112/153 looper letters, 546 selfloop transitions, 390 changer transitions 13/1024 dead transitions. [2022-01-19 08:28:14,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 1024 transitions, 12952 flow [2022-01-19 08:28:14,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-19 08:28:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-01-19 08:28:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3551 transitions. [2022-01-19 08:28:14,621 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4938117090807954 [2022-01-19 08:28:14,621 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 3551 transitions. [2022-01-19 08:28:14,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 3551 transitions. [2022-01-19 08:28:14,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:28:14,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 3551 transitions. [2022-01-19 08:28:14,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 75.55319148936171) internal successors, (3551), 47 states have internal predecessors, (3551), 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-01-19 08:28:14,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 153.0) internal successors, (7344), 48 states have internal predecessors, (7344), 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-01-19 08:28:14,637 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 153.0) internal successors, (7344), 48 states have internal predecessors, (7344), 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-01-19 08:28:14,637 INFO L186 Difference]: Start difference. First operand has 415 places, 656 transitions, 6947 flow. Second operand 47 states and 3551 transitions. [2022-01-19 08:28:14,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 1024 transitions, 12952 flow [2022-01-19 08:28:16,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 1024 transitions, 12022 flow, removed 439 selfloop flow, removed 33 redundant places. [2022-01-19 08:28:16,897 INFO L242 Difference]: Finished difference. Result has 435 places, 795 transitions, 9250 flow [2022-01-19 08:28:16,897 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=6276, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=261, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=9250, PETRI_PLACES=435, PETRI_TRANSITIONS=795} [2022-01-19 08:28:16,898 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 298 predicate places. [2022-01-19 08:28:16,898 INFO L470 AbstractCegarLoop]: Abstraction has has 435 places, 795 transitions, 9250 flow [2022-01-19 08:28:16,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 71.61538461538461) internal successors, (3724), 52 states have internal predecessors, (3724), 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-01-19 08:28:16,899 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:28:16,899 INFO L254 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] [2022-01-19 08:28:16,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-19 08:28:17,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:28:17,116 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 08:28:17,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:28:17,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1482560342, now seen corresponding path program 5 times [2022-01-19 08:28:17,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:28:17,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252642893] [2022-01-19 08:28:17,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:28:17,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:28:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:28:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:28:17,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:28:17,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252642893] [2022-01-19 08:28:17,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252642893] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:28:17,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643784742] [2022-01-19 08:28:17,832 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 08:28:17,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:28:17,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:28:17,833 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:28:17,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 08:28:17,904 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 08:28:17,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:28:17,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-19 08:28:17,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:28:18,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 08:28:18,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 08:28:18,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 08:28:19,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:28:19,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-01-19 08:28:19,440 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:28:19,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 45 [2022-01-19 08:28:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:28:19,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:28:20,377 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (and (forall ((v_ArrVal_294 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse0)) (= .cse0 c_~max1~0)))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_294 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-19 08:28:20,756 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse1 (forall ((v_ArrVal_294 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))) (.cse2 (< c_~max1~0 .cse4))) (and (or (and (forall ((v_ArrVal_294 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse0)) (= .cse0 c_~max1~0)))) (or (= c_~max1~0 c_~max2~0) .cse1)) .cse2) (or (and (forall ((v_ArrVal_294 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse3)) (= .cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))))) (or .cse1 (= .cse4 c_~max2~0))) (not .cse2))))))) is different from false [2022-01-19 08:28:35,358 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:28:35,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 304 treesize of output 197 [2022-01-19 08:28:35,391 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:28:35,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 15221 treesize of output 14013 [2022-01-19 08:28:35,497 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:28:35,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13968 treesize of output 13905 [2022-01-19 08:28:35,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13892 treesize of output 13796 [2022-01-19 08:28:35,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13796 treesize of output 13604 [2022-01-19 08:28:35,699 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:28:35,700 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13604 treesize of output 13465 [2022-01-19 08:28:35,770 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:28:35,771 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13452 treesize of output 12745 [2022-01-19 08:28:35,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 12732 treesize of output 11004 [2022-01-19 08:28:35,886 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:28:35,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11004 treesize of output 9577 [2022-01-19 08:28:35,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 9564 treesize of output 9468 [2022-01-19 08:28:35,996 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 08:28:35,998 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-19 08:28:36,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 08:28:36,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-19 08:28:36,212 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2022-01-19 08:28:36,214 INFO L158 Benchmark]: Toolchain (without parser) took 84833.82ms. Allocated memory was 354.4MB in the beginning and 3.5GB in the end (delta: 3.2GB). Free memory was 299.3MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2022-01-19 08:28:36,214 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 354.4MB. Free memory is still 315.8MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 08:28:36,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.62ms. Allocated memory was 354.4MB in the beginning and 507.5MB in the end (delta: 153.1MB). Free memory was 299.2MB in the beginning and 479.8MB in the end (delta: -180.6MB). Peak memory consumption was 9.1MB. Max. memory is 16.0GB. [2022-01-19 08:28:36,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.58ms. Allocated memory is still 507.5MB. Free memory was 479.8MB in the beginning and 477.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 08:28:36,214 INFO L158 Benchmark]: Boogie Preprocessor took 34.68ms. Allocated memory is still 507.5MB. Free memory was 477.7MB in the beginning and 475.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 08:28:36,214 INFO L158 Benchmark]: RCFGBuilder took 336.05ms. Allocated memory is still 507.5MB. Free memory was 475.6MB in the beginning and 455.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2022-01-19 08:28:36,215 INFO L158 Benchmark]: TraceAbstraction took 84199.49ms. Allocated memory was 507.5MB in the beginning and 3.5GB in the end (delta: 3.0GB). Free memory was 454.6MB in the beginning and 2.4GB in the end (delta: -1.9GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2022-01-19 08:28:36,215 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 354.4MB. Free memory is still 315.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 225.62ms. Allocated memory was 354.4MB in the beginning and 507.5MB in the end (delta: 153.1MB). Free memory was 299.2MB in the beginning and 479.8MB in the end (delta: -180.6MB). Peak memory consumption was 9.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.58ms. Allocated memory is still 507.5MB. Free memory was 479.8MB in the beginning and 477.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.68ms. Allocated memory is still 507.5MB. Free memory was 477.7MB in the beginning and 475.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 336.05ms. Allocated memory is still 507.5MB. Free memory was 475.6MB in the beginning and 455.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 84199.49ms. Allocated memory was 507.5MB in the beginning and 3.5GB in the end (delta: 3.0GB). Free memory was 454.6MB in the beginning and 2.4GB in the end (delta: -1.9GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-19 08:28:36,249 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 0 Received shutdown request...