/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-16 01:45:17,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 01:45:17,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 01:45:17,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 01:45:17,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 01:45:17,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 01:45:17,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 01:45:17,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 01:45:17,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 01:45:17,658 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 01:45:17,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 01:45:17,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 01:45:17,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 01:45:17,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 01:45:17,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 01:45:17,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 01:45:17,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 01:45:17,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 01:45:17,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 01:45:17,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 01:45:17,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 01:45:17,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 01:45:17,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 01:45:17,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 01:45:17,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 01:45:17,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 01:45:17,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 01:45:17,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 01:45:17,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 01:45:17,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 01:45:17,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 01:45:17,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 01:45:17,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 01:45:17,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 01:45:17,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 01:45:17,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 01:45:17,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 01:45:17,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 01:45:17,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 01:45:17,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 01:45:17,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 01:45:17,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-16 01:45:17,709 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 01:45:17,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 01:45:17,709 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 01:45:17,709 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 01:45:17,710 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 01:45:17,710 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 01:45:17,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 01:45:17,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 01:45:17,711 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 01:45:17,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 01:45:17,711 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 01:45:17,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 01:45:17,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 01:45:17,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 01:45:17,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 01:45:17,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 01:45:17,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 01:45:17,712 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 01:45:17,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 01:45:17,712 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 01:45:17,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 01:45:17,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 01:45:17,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 01:45:17,713 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-16 01:45:17,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 01:45:17,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 01:45:17,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 01:45:17,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 01:45:17,714 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 01:45:17,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 01:45:17,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 01:45:17,714 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 01:45:17,714 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-16 01:45:17,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 01:45:17,714 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-16 01:45:17,714 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-16 01:45:17,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2022-11-16 01:45:17,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 01:45:17,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 01:45:17,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 01:45:17,909 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 01:45:17,910 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 01:45:17,911 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-11-16 01:45:17,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e2a4ca33/0abb277240c74b77994f886b5079991f/FLAGeebbaf7ee [2022-11-16 01:45:18,324 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 01:45:18,325 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-11-16 01:45:18,329 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e2a4ca33/0abb277240c74b77994f886b5079991f/FLAGeebbaf7ee [2022-11-16 01:45:18,337 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e2a4ca33/0abb277240c74b77994f886b5079991f [2022-11-16 01:45:18,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 01:45:18,340 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-16 01:45:18,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 01:45:18,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 01:45:18,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 01:45:18,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:45:18" (1/1) ... [2022-11-16 01:45:18,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e21129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:45:18, skipping insertion in model container [2022-11-16 01:45:18,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:45:18" (1/1) ... [2022-11-16 01:45:18,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 01:45:18,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 01:45:18,514 WARN L233 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-hom.wvr.c[2586,2599] [2022-11-16 01:45:18,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 01:45:18,524 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 01:45:18,539 WARN L233 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-hom.wvr.c[2586,2599] [2022-11-16 01:45:18,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 01:45:18,550 INFO L208 MainTranslator]: Completed translation [2022-11-16 01:45:18,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:45:18 WrapperNode [2022-11-16 01:45:18,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 01:45:18,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 01:45:18,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 01:45:18,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 01:45:18,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:45:18" (1/1) ... [2022-11-16 01:45:18,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:45:18" (1/1) ... [2022-11-16 01:45:18,600 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-11-16 01:45:18,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 01:45:18,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 01:45:18,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 01:45:18,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 01:45:18,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:45:18" (1/1) ... [2022-11-16 01:45:18,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:45:18" (1/1) ... [2022-11-16 01:45:18,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:45:18" (1/1) ... [2022-11-16 01:45:18,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:45:18" (1/1) ... [2022-11-16 01:45:18,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:45:18" (1/1) ... [2022-11-16 01:45:18,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:45:18" (1/1) ... [2022-11-16 01:45:18,625 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:45:18" (1/1) ... [2022-11-16 01:45:18,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:45:18" (1/1) ... [2022-11-16 01:45:18,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 01:45:18,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 01:45:18,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 01:45:18,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 01:45:18,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:45:18" (1/1) ... [2022-11-16 01:45:18,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 01:45:18,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:45:18,669 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-11-16 01:45:18,672 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-11-16 01:45:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 01:45:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 01:45:18,708 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 01:45:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 01:45:18,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 01:45:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 01:45:18,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 01:45:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 01:45:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 01:45:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 01:45:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 01:45:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 01:45:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 01:45:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 01:45:18,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 01:45:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 01:45:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 01:45:18,715 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 01:45:18,791 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 01:45:18,793 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 01:45:19,034 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 01:45:19,079 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 01:45:19,079 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 01:45:19,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 01:45:19 BoogieIcfgContainer [2022-11-16 01:45:19,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 01:45:19,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 01:45:19,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 01:45:19,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 01:45:19,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:45:18" (1/3) ... [2022-11-16 01:45:19,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb0d1ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:45:19, skipping insertion in model container [2022-11-16 01:45:19,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:45:18" (2/3) ... [2022-11-16 01:45:19,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb0d1ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:45:19, skipping insertion in model container [2022-11-16 01:45:19,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 01:45:19" (3/3) ... [2022-11-16 01:45:19,087 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-11-16 01:45:19,104 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 01:45:19,110 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 01:45:19,110 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 01:45:19,110 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 01:45:19,176 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 01:45:19,221 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 01:45:19,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 01:45:19,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:45:19,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-16 01:45:19,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-16 01:45:19,247 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 01:45:19,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-11-16 01:45:19,260 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6512d62a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 01:45:19,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 01:45:19,469 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:45:19,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:45:19,475 INFO L85 PathProgramCache]: Analyzing trace with hash 900810574, now seen corresponding path program 1 times [2022-11-16 01:45:19,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:45:19,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112550033] [2022-11-16 01:45:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:45:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:45:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:45:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:45:19,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:45:19,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112550033] [2022-11-16 01:45:19,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112550033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 01:45:19,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 01:45:19,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 01:45:19,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044714678] [2022-11-16 01:45:19,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 01:45:19,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 01:45:19,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:45:19,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 01:45:19,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 01:45:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:19,716 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:45:19,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 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-11-16 01:45:19,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:19,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:19,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 01:45:19,759 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:45:19,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:45:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash 5295436, now seen corresponding path program 1 times [2022-11-16 01:45:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:45:19,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534586564] [2022-11-16 01:45:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:45:19,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:45:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:45:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:45:20,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:45:20,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534586564] [2022-11-16 01:45:20,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534586564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 01:45:20,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 01:45:20,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 01:45:20,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061642335] [2022-11-16 01:45:20,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 01:45:20,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 01:45:20,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:45:20,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 01:45:20,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-16 01:45:20,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:20,191 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:45:20,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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-11-16 01:45:20,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:20,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:20,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:20,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:45:20,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 01:45:20,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:45:20,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:45:20,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1627563919, now seen corresponding path program 1 times [2022-11-16 01:45:20,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:45:20,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490675497] [2022-11-16 01:45:20,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:45:20,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:45:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:45:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:45:20,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:45:20,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490675497] [2022-11-16 01:45:20,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490675497] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:45:20,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547372660] [2022-11-16 01:45:20,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:45:20,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:45:20,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:45:20,514 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-11-16 01:45:20,515 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-11-16 01:45:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:45:20,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 01:45:20,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:45:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:45:20,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:45:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:45:20,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547372660] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 01:45:20,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 01:45:20,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-16 01:45:20,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244608724] [2022-11-16 01:45:20,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 01:45:20,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 01:45:20,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:45:20,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 01:45:20,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-16 01:45:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:20,921 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:45:20,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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-11-16 01:45:20,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:20,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:45:20,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:20,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:20,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:45:20,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:45:21,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 01:45:21,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-16 01:45:21,200 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:45:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:45:21,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1742110344, now seen corresponding path program 1 times [2022-11-16 01:45:21,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:45:21,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269507912] [2022-11-16 01:45:21,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:45:21,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:45:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:45:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:45:21,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:45:21,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269507912] [2022-11-16 01:45:21,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269507912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:45:21,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786567961] [2022-11-16 01:45:21,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:45:21,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:45:21,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:45:21,330 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-11-16 01:45:21,378 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-11-16 01:45:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:45:21,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 01:45:21,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:45:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:45:21,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:45:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:45:21,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786567961] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 01:45:21,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 01:45:21,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-11-16 01:45:21,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748741183] [2022-11-16 01:45:21,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 01:45:21,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 01:45:21,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:45:21,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 01:45:21,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-11-16 01:45:21,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:21,737 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:45:21,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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-11-16 01:45:21,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:21,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:45:21,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:45:21,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:21,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:21,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:45:21,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:45:21,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:45:21,873 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-11-16 01:45:22,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:45:22,060 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:45:22,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:45:22,061 INFO L85 PathProgramCache]: Analyzing trace with hash 998227617, now seen corresponding path program 1 times [2022-11-16 01:45:22,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:45:22,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040660921] [2022-11-16 01:45:22,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:45:22,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:45:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:45:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:45:23,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:45:23,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040660921] [2022-11-16 01:45:23,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040660921] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:45:23,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996594263] [2022-11-16 01:45:23,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:45:23,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:45:23,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:45:23,210 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-11-16 01:45:23,213 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-11-16 01:45:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:45:23,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 01:45:23,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:45:24,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:45:24,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 42 [2022-11-16 01:45:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:45:24,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:45:25,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:45:25,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 164 [2022-11-16 01:45:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:45:29,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996594263] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:45:29,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:45:29,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 21] total 52 [2022-11-16 01:45:29,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320591673] [2022-11-16 01:45:29,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:45:29,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-16 01:45:29,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:45:29,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-16 01:45:29,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=2169, Unknown=0, NotChecked=0, Total=2652 [2022-11-16 01:45:29,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:29,081 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:45:29,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.788461538461538) internal successors, (249), 52 states have internal predecessors, (249), 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-11-16 01:45:29,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:29,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:45:29,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:45:29,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:45:29,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:30,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:30,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:45:30,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:45:30,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:45:30,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-16 01:45:30,634 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-11-16 01:45:30,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:45:30,819 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:45:30,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:45:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1438144984, now seen corresponding path program 2 times [2022-11-16 01:45:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:45:30,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578668664] [2022-11-16 01:45:30,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:45:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:45:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:45:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:45:31,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:45:31,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578668664] [2022-11-16 01:45:31,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578668664] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:45:31,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219248555] [2022-11-16 01:45:31,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 01:45:31,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:45:31,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:45:31,156 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-11-16 01:45:31,158 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-11-16 01:45:31,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 01:45:31,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 01:45:31,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 01:45:31,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:45:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:45:31,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:45:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:45:31,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219248555] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:45:31,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:45:31,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 34 [2022-11-16 01:45:31,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19891230] [2022-11-16 01:45:31,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:45:31,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 01:45:31,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:45:31,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 01:45:31,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 01:45:31,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:31,863 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:45:31,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.352941176470589) internal successors, (284), 34 states have internal predecessors, (284), 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-11-16 01:45:31,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:31,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:45:31,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:45:31,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:45:31,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-16 01:45:31,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:45:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:45:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 01:45:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 01:45:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 01:45:32,900 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-11-16 01:45:33,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:45:33,098 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:45:33,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:45:33,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1153615117, now seen corresponding path program 1 times [2022-11-16 01:45:33,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:45:33,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220884221] [2022-11-16 01:45:33,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:45:33,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:45:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:45:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:45:33,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:45:33,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220884221] [2022-11-16 01:45:33,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220884221] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:45:33,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095429280] [2022-11-16 01:45:33,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:45:33,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:45:33,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:45:33,383 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-11-16 01:45:33,395 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-11-16 01:45:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:45:33,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 01:45:33,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:45:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:45:33,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:45:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:45:33,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095429280] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:45:33,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:45:33,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2022-11-16 01:45:33,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858859701] [2022-11-16 01:45:33,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:45:33,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-16 01:45:33,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:45:33,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-16 01:45:33,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2022-11-16 01:45:33,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:33,899 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:45:33,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.419354838709678) internal successors, (261), 31 states have internal predecessors, (261), 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-11-16 01:45:33,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:33,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:45:33,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:45:33,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-16 01:45:33,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-16 01:45:33,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-16 01:45:33,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:45:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:45:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:45:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-16 01:45:34,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 01:45:34,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:45:34,786 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-11-16 01:45:34,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:45:34,987 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:45:34,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:45:34,988 INFO L85 PathProgramCache]: Analyzing trace with hash -601000968, now seen corresponding path program 3 times [2022-11-16 01:45:34,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:45:34,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523451877] [2022-11-16 01:45:34,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:45:34,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:45:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:45:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:45:35,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:45:35,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523451877] [2022-11-16 01:45:35,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523451877] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:45:35,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455321245] [2022-11-16 01:45:35,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 01:45:35,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:45:35,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:45:35,164 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-11-16 01:45:35,166 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-11-16 01:45:35,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 01:45:35,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 01:45:35,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 01:45:35,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:45:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:45:35,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:45:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:45:35,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455321245] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:45:35,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:45:35,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-11-16 01:45:35,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837565340] [2022-11-16 01:45:35,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:45:35,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 01:45:35,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:45:35,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 01:45:35,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-11-16 01:45:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:35,533 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:45:35,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.24) internal successors, (231), 25 states have internal predecessors, (231), 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-11-16 01:45:35,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:35,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:45:35,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:45:35,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:45:35,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-11-16 01:45:35,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-16 01:45:35,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:45:35,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:45:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:45:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:45:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-16 01:45:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 01:45:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:45:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 01:45:36,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 01:45:36,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:45:36,728 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:45:36,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:45:36,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1200311733, now seen corresponding path program 4 times [2022-11-16 01:45:36,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:45:36,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149035684] [2022-11-16 01:45:36,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:45:36,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:45:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:45:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:45:37,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:45:37,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149035684] [2022-11-16 01:45:37,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149035684] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:45:37,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942595932] [2022-11-16 01:45:37,999 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 01:45:37,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:45:37,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:45:38,000 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-11-16 01:45:38,005 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-11-16 01:45:38,101 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 01:45:38,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 01:45:38,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 01:45:38,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:45:38,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 01:45:38,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-16 01:45:39,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:45:39,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2022-11-16 01:45:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:45:39,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:45:40,782 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0))) (and (or .cse0 (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse1) (not (< c_~max3~0 .cse1)) (< (+ ~M~0 1) c_~N~0))))) (or (and (or .cse0 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (or (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse2 c_~max2~0) (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse2) (not (< c_~max3~0 .cse2)) (< (+ ~M~0 1) c_~N~0)))))) is different from false [2022-11-16 01:45:40,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:45:40,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 276 [2022-11-16 01:45:40,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 169 [2022-11-16 01:45:40,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 163 [2022-11-16 01:45:40,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 145 [2022-11-16 01:45:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:45:45,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942595932] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:45:45,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:45:45,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 74 [2022-11-16 01:45:45,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608724234] [2022-11-16 01:45:45,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:45:45,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-16 01:45:45,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:45:45,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-16 01:45:45,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=686, Invalid=4573, Unknown=1, NotChecked=142, Total=5402 [2022-11-16 01:45:45,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:45,599 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:45:45,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 4.45945945945946) internal successors, (330), 74 states have internal predecessors, (330), 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-11-16 01:45:45,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:45,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:45:45,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:45:45,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:45:45,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-16 01:45:45,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-16 01:45:45,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:45:45,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-16 01:45:45,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:45:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:45:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:45:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:45:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-16 01:45:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 01:45:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:45:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 01:45:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-16 01:45:49,046 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-11-16 01:45:49,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-16 01:45:49,242 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:45:49,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:45:49,242 INFO L85 PathProgramCache]: Analyzing trace with hash 231166643, now seen corresponding path program 5 times [2022-11-16 01:45:49,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:45:49,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967882245] [2022-11-16 01:45:49,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:45:49,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:45:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:45:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:45:50,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:45:50,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967882245] [2022-11-16 01:45:50,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967882245] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:45:50,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125945930] [2022-11-16 01:45:50,513 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 01:45:50,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:45:50,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:45:50,514 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 01:45:50,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 01:45:50,618 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 01:45:50,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 01:45:50,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 01:45:50,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:45:50,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 01:45:50,754 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 01:45:50,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-16 01:45:51,222 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 01:45:51,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 01:45:51,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 01:45:51,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 01:45:51,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-16 01:45:52,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 01:45:52,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-16 01:45:52,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:45:52,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 42 [2022-11-16 01:45:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:45:52,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:45:54,114 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~max1~0 c_~max2~0))) (and (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max2~0 .cse0) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse0)) (< (+ ~M~0 1) c_~N~0)))) .cse1) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0))) (and (or .cse1 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0)))) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int)) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse2) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse2)) (<= .cse2 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))))) is different from false [2022-11-16 01:45:56,321 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0))) (and (or (and (or .cse0 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (or (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse1 c_~max2~0) (not (< c_~max3~0 .cse1)) (not (< ~M~0 c_~N~0)) (= .cse1 c_~max1~0) (< (+ ~M~0 1) c_~N~0)))) (or .cse0 (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse2)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse2) (< (+ ~M~0 1) c_~N~0))))))) is different from false [2022-11-16 01:46:27,593 WARN L233 SmtUtils]: Spent 11.34s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 01:46:33,729 WARN L233 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 01:46:42,792 WARN L233 SmtUtils]: Spent 8.85s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 01:46:43,475 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (let ((.cse0 (<= c_~max3~0 c_~max2~0)) (.cse4 (= c_~max1~0 c_~max2~0)) (.cse5 (< c_~max2~0 c_~max3~0))) (and (or .cse0 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse1)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (= .cse1 c_~max3~0) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))) (and (or .cse4 .cse5) (or (= c_~max1~0 c_~max3~0) .cse0))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse6 (select (select .cse8 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse6)) (= .cse6 c_~max2~0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse7 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse7)) (< c_~max2~0 .cse7) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse9 (select (select .cse11 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse9)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse10 (select (select (store (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse10)) (= .cse10 .cse9) (not (< ~M~0 c_~N~0)) (<= .cse10 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))))))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse12 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse12)) (< c_~max2~0 .cse12) (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse13 c_~A~0.base) c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0))))) .cse4) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse14 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse14)) (= c_~max1~0 .cse14) (not (< ~M~0 c_~N~0)) (<= .cse14 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select .cse15 c_~A~0.base) c_~A~0.offset))))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse16 (select (select .cse17 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse16)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (= .cse16 c_~max2~0) (< (+ ~M~0 1) c_~N~0))))) .cse5)))) is different from false [2022-11-16 01:46:45,675 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse4 (< c_~max2~0 c_~max3~0)) (.cse5 (<= c_~max3~0 c_~max2~0)) (.cse3 (= c_~max1~0 c_~max2~0))) (and (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse0)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse0) (< (+ ~M~0 1) c_~N~0)))) (= .cse2 c_~max2~0) (not (< c_~max1~0 .cse2)))))) (or (and (or .cse3 .cse4) (or (= c_~max1~0 c_~max3~0) .cse5)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< c_~max1~0 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< (+ ~M~0 1) c_~N~0))))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse7 c_~max2~0) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (not (< c_~max1~0 .cse7)) (< (+ ~M~0 1) c_~N~0))))) .cse4) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse10 (select (select (store (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse9 .cse10) (not (< c_~max3~0 .cse10)) (not (< ~M~0 c_~N~0)) (<= .cse10 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse9)))))) (or .cse5 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse12 c_~max3~0) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (not (< c_~max1~0 .cse12)) (< (+ ~M~0 1) c_~N~0)))))) (or .cse3 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse14 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse14)) (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max2~0 .cse14) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (< c_~max1~0 (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse17 (select (select (store (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse17)) (= c_~max1~0 .cse17) (not (< ~M~0 c_~N~0)) (<= .cse17 c_~max2~0) (< (+ ~M~0 1) c_~N~0))))))))) (not (< 0 c_~N~0))) is different from false [2022-11-16 01:46:45,809 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (let ((.cse7 (= c_~max1~0 c_~max2~0)) (.cse2 (< c_~max2~0 c_~max3~0)) (.cse14 (<= c_~max3~0 c_~max2~0))) (and (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= c_~max2~0 .cse1) (not (< c_~max1~0 .cse1)) (< (+ ~M~0 1) c_~N~0))))) .cse2) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse3)) (not (< ~M~0 c_~N~0)) (= .cse3 c_~max1~0) (<= .cse3 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse6 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~max1~0 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (< c_~max3~0 .cse6)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse6) (< (+ ~M~0 1) c_~N~0))))) .cse7) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse8 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse8)) (not (< ~M~0 c_~N~0)) (<= .cse8 c_~max2~0) (= .cse8 .cse9) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse9)))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse11 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse11)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse11) (< (+ ~M~0 1) c_~N~0)))) (= c_~max2~0 .cse13) (not (< c_~max1~0 .cse13)))))) (or (and (or .cse7 .cse2) (or (= c_~max1~0 c_~max3~0) .cse14)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (< c_~max1~0 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (+ ~M~0 1) c_~N~0))))) (or .cse14 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< ~M~0 c_~N~0)) (= c_~max3~0 .cse16) (< c_~max3~0 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (< c_~max1~0 .cse16)) (< (+ ~M~0 1) c_~N~0))))))))) is different from false [2022-11-16 01:46:50,881 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:46:50,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2022-11-16 01:46:50,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:46:50,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 183 [2022-11-16 01:46:50,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 112 [2022-11-16 01:46:50,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 100 [2022-11-16 01:46:50,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:46:50,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 82 [2022-11-16 01:46:51,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:46:51,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 75 [2022-11-16 01:46:51,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:46:51,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 657 treesize of output 627 [2022-11-16 01:46:51,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 580 treesize of output 484 [2022-11-16 01:46:51,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 484 treesize of output 436 [2022-11-16 01:46:51,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:46:51,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 366 treesize of output 348 [2022-11-16 01:46:51,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:46:51,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2022-11-16 01:46:51,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:46:51,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 319 treesize of output 309 [2022-11-16 01:46:51,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 234 [2022-11-16 01:46:51,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:46:51,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 123 [2022-11-16 01:46:51,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 198 [2022-11-16 01:46:52,094 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 01:46:52,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 1 [2022-11-16 01:46:52,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:46:52,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 84 [2022-11-16 01:46:52,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:46:52,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1870 treesize of output 1780 [2022-11-16 01:46:52,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1753 treesize of output 1465 [2022-11-16 01:46:52,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1465 treesize of output 1321 [2022-11-16 01:46:52,167 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:46:52,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1330 treesize of output 1266 [2022-11-16 01:46:59,866 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 01:46:59,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 1 [2022-11-16 01:46:59,880 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 01:46:59,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-11-16 01:47:01,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 01:47:01,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 01:47:01,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 01:47:01,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 01:47:01,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 01:47:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:03,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125945930] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:47:03,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:47:03,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 82 [2022-11-16 01:47:03,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881567549] [2022-11-16 01:47:03,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:47:03,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-11-16 01:47:03,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:47:03,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-11-16 01:47:03,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=5065, Unknown=24, NotChecked=770, Total=6642 [2022-11-16 01:47:03,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:03,527 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:47:03,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 3.792682926829268) internal successors, (311), 82 states have internal predecessors, (311), 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-11-16 01:47:03,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:03,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:47:03,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:03,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:47:03,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-16 01:47:03,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-16 01:47:03,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:47:03,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-16 01:47:03,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-11-16 01:47:03,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:47:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:47:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-16 01:47:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 01:47:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 01:47:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 01:47:11,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-16 01:47:11,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-16 01:47:11,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 01:47:11,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 01:47:11,853 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:47:11,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:47:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1733629837, now seen corresponding path program 6 times [2022-11-16 01:47:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:47:11,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197195789] [2022-11-16 01:47:11,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:11,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:47:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 01:47:11,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:47:11,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197195789] [2022-11-16 01:47:11,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197195789] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:47:11,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613180071] [2022-11-16 01:47:11,994 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 01:47:11,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:11,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:47:12,005 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 01:47:12,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 01:47:12,108 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-16 01:47:12,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 01:47:12,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 01:47:12,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:47:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 01:47:12,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:47:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 01:47:12,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613180071] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:47:12,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:47:12,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-16 01:47:12,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57194465] [2022-11-16 01:47:12,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:47:12,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 01:47:12,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:47:12,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 01:47:12,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-11-16 01:47:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:12,423 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:47:12,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.458333333333333) internal successors, (179), 24 states have internal predecessors, (179), 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-11-16 01:47:12,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:12,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:47:12,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:12,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:47:12,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-16 01:47:12,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 01:47:12,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-16 01:47:12,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 01:47:12,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2022-11-16 01:47:12,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-11-16 01:47:12,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 01:47:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:47:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-16 01:47:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 01:47:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 01:47:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 01:47:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-16 01:47:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-16 01:47:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 01:47:13,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 01:47:13,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 01:47:13,436 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:47:13,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:47:13,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1033677588, now seen corresponding path program 7 times [2022-11-16 01:47:13,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:47:13,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792350923] [2022-11-16 01:47:13,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:13,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:47:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:17,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:47:17,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792350923] [2022-11-16 01:47:17,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792350923] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:47:17,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137335132] [2022-11-16 01:47:17,035 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 01:47:17,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:17,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:47:17,036 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 01:47:17,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 01:47:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:17,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 01:47:17,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:47:19,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 01:47:19,032 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:47:19,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 108 [2022-11-16 01:47:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:19,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:47:29,451 WARN L233 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 01:47:37,438 WARN L233 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 01:47:52,623 WARN L233 SmtUtils]: Spent 9.38s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 01:48:17,146 WARN L233 SmtUtils]: Spent 24.43s on a formula simplification that was a NOOP. DAG size: 1652 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-16 01:48:17,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:48:17,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 30 select indices, 30 select index equivalence classes, 0 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 435 case distinctions, treesize of input 935 treesize of output 5823 Received shutdown request... [2022-11-16 01:59:42,306 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 01:59:42,306 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 01:59:42,306 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 01:59:42,354 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 01:59:42,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 01:59:42,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 01:59:42,556 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-6-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-448-27-7-8-7-7-7-6-7-6-7-6-7-6-7-6-7-6-7-6-7-6-2-2-1 context. [2022-11-16 01:59:42,560 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2022-11-16 01:59:42,561 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/4) [2022-11-16 01:59:42,562 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 01:59:42,562 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 01:59:42,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 01:59:42 BasicIcfg [2022-11-16 01:59:42,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 01:59:42,564 INFO L158 Benchmark]: Toolchain (without parser) took 864224.64ms. Allocated memory was 190.8MB in the beginning and 1.1GB in the end (delta: 891.3MB). Free memory was 134.4MB in the beginning and 972.3MB in the end (delta: -837.9MB). Peak memory consumption was 675.2MB. Max. memory is 8.0GB. [2022-11-16 01:59:42,565 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory was 150.7MB in the beginning and 150.6MB in the end (delta: 75.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-11-16 01:59:42,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.31ms. Allocated memory is still 190.8MB. Free memory was 134.1MB in the beginning and 164.2MB in the end (delta: -30.1MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-11-16 01:59:42,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.24ms. Allocated memory is still 190.8MB. Free memory was 163.9MB in the beginning and 162.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-16 01:59:42,565 INFO L158 Benchmark]: Boogie Preprocessor took 27.23ms. Allocated memory is still 190.8MB. Free memory was 162.1MB in the beginning and 160.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-11-16 01:59:42,565 INFO L158 Benchmark]: RCFGBuilder took 452.50ms. Allocated memory is still 190.8MB. Free memory was 160.6MB in the beginning and 139.8MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-11-16 01:59:42,566 INFO L158 Benchmark]: TraceAbstraction took 863481.52ms. Allocated memory was 190.8MB in the beginning and 1.1GB in the end (delta: 891.3MB). Free memory was 139.3MB in the beginning and 972.3MB in the end (delta: -832.9MB). Peak memory consumption was 679.9MB. Max. memory is 8.0GB. [2022-11-16 01:59:42,567 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.13ms. Allocated memory is still 190.8MB. Free memory was 150.7MB in the beginning and 150.6MB in the end (delta: 75.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.31ms. Allocated memory is still 190.8MB. Free memory was 134.1MB in the beginning and 164.2MB in the end (delta: -30.1MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.24ms. Allocated memory is still 190.8MB. Free memory was 163.9MB in the beginning and 162.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.23ms. Allocated memory is still 190.8MB. Free memory was 162.1MB in the beginning and 160.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 452.50ms. Allocated memory is still 190.8MB. Free memory was 160.6MB in the beginning and 139.8MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 863481.52ms. Allocated memory was 190.8MB in the beginning and 1.1GB in the end (delta: 891.3MB). Free memory was 139.3MB in the beginning and 972.3MB in the end (delta: -832.9MB). Peak memory consumption was 679.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 45115, independent: 39510, independent conditional: 37297, independent unconditional: 2213, dependent: 5605, dependent conditional: 5587, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39530, independent: 39510, independent conditional: 37297, independent unconditional: 2213, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39530, independent: 39510, independent conditional: 37297, independent unconditional: 2213, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39552, independent: 39510, independent conditional: 5, independent unconditional: 39505, dependent: 42, dependent conditional: 17, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39552, independent: 39510, independent conditional: 5, independent unconditional: 39505, dependent: 42, dependent conditional: 9, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39552, independent: 39510, independent conditional: 5, independent unconditional: 39505, dependent: 42, dependent conditional: 9, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1987, independent: 1960, independent conditional: 3, independent unconditional: 1957, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1987, independent: 1955, independent conditional: 0, independent unconditional: 1955, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 32, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, independent: 50, independent conditional: 18, independent unconditional: 32, dependent: 107, dependent conditional: 18, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 39552, independent: 37550, independent conditional: 2, independent unconditional: 37548, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1987, unknown conditional: 12, unknown unconditional: 1975] , Statistics on independence cache: Total cache size (in pairs): 1987, Positive cache size: 1960, Positive conditional cache size: 3, Positive unconditional cache size: 1957, Negative cache size: 27, Negative conditional cache size: 9, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 8, Independence queries for same thread: 5585 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 1756, Number of trivial persistent sets: 1738, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2231, independent: 2213, independent conditional: 0, independent unconditional: 2213, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 45115, independent: 39510, independent conditional: 37297, independent unconditional: 2213, dependent: 5605, dependent conditional: 5587, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39530, independent: 39510, independent conditional: 37297, independent unconditional: 2213, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39530, independent: 39510, independent conditional: 37297, independent unconditional: 2213, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39552, independent: 39510, independent conditional: 5, independent unconditional: 39505, dependent: 42, dependent conditional: 17, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39552, independent: 39510, independent conditional: 5, independent unconditional: 39505, dependent: 42, dependent conditional: 9, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39552, independent: 39510, independent conditional: 5, independent unconditional: 39505, dependent: 42, dependent conditional: 9, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1987, independent: 1960, independent conditional: 3, independent unconditional: 1957, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1987, independent: 1955, independent conditional: 0, independent unconditional: 1955, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 32, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, independent: 50, independent conditional: 18, independent unconditional: 32, dependent: 107, dependent conditional: 18, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 39552, independent: 37550, independent conditional: 2, independent unconditional: 37548, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1987, unknown conditional: 12, unknown unconditional: 1975] , Statistics on independence cache: Total cache size (in pairs): 1987, Positive cache size: 1960, Positive conditional cache size: 3, Positive unconditional cache size: 1957, Negative cache size: 27, Negative conditional cache size: 9, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 8, Independence queries for same thread: 5585 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-6-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-448-27-7-8-7-7-7-6-7-6-7-6-7-6-7-6-7-6-7-6-7-6-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 173 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 863.3s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 17.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 320, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 93.4s InterpolantComputationTime, 2444 NumberOfCodeBlocks, 2444 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3529 ConstructedInterpolants, 119 QuantifiedInterpolants, 52710 SizeOfPredicates, 154 NumberOfNonLiveVariables, 2587 ConjunctsInSsa, 210 ConjunctsInUnsatCore, 29 InterpolantComputations, 4 PerfectInterpolantSequences, 77/150 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown