/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/unroll-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-16 02:16:44,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 02:16:44,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 02:16:44,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 02:16:44,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 02:16:44,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 02:16:44,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 02:16:44,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 02:16:44,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 02:16:44,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 02:16:44,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 02:16:44,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 02:16:44,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 02:16:44,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 02:16:44,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 02:16:44,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 02:16:44,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 02:16:44,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 02:16:44,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 02:16:44,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 02:16:44,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 02:16:44,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 02:16:44,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 02:16:44,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 02:16:44,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 02:16:44,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 02:16:44,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 02:16:44,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 02:16:44,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 02:16:44,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 02:16:44,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 02:16:44,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 02:16:44,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 02:16:44,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 02:16:44,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 02:16:44,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 02:16:44,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 02:16:44,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 02:16:44,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 02:16:44,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 02:16:44,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 02:16:44,754 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-16 02:16:44,783 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 02:16:44,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 02:16:44,784 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 02:16:44,784 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 02:16:44,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 02:16:44,784 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 02:16:44,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 02:16:44,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 02:16:44,785 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 02:16:44,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 02:16:44,786 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 02:16:44,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 02:16:44,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 02:16:44,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 02:16:44,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 02:16:44,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 02:16:44,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 02:16:44,786 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 02:16:44,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 02:16:44,786 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 02:16:44,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 02:16:44,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 02:16:44,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 02:16:44,787 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-16 02:16:44,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 02:16:44,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 02:16:44,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 02:16:44,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 02:16:44,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 02:16:44,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 02:16:44,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 02:16:44,788 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 02:16:44,788 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-16 02:16:44,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 02:16:44,788 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-16 02:16:44,788 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-16 02:16:44,788 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 02:16:44,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 02:16:44,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 02:16:44,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 02:16:44,985 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 02:16:44,986 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 02:16:44,987 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c [2022-11-16 02:16:45,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218d9b71c/b11623368d054f2db1f9720ca387143c/FLAG820538d01 [2022-11-16 02:16:45,404 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 02:16:45,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c [2022-11-16 02:16:45,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218d9b71c/b11623368d054f2db1f9720ca387143c/FLAG820538d01 [2022-11-16 02:16:45,419 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218d9b71c/b11623368d054f2db1f9720ca387143c [2022-11-16 02:16:45,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 02:16:45,423 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-16 02:16:45,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 02:16:45,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 02:16:45,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 02:16:45,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:16:45" (1/1) ... [2022-11-16 02:16:45,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42b9f149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:16:45, skipping insertion in model container [2022-11-16 02:16:45,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:16:45" (1/1) ... [2022-11-16 02:16:45,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 02:16:45,460 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 02:16:45,617 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/unroll-5.wvr.c[2644,2657] [2022-11-16 02:16:45,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 02:16:45,633 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 02:16:45,649 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/unroll-5.wvr.c[2644,2657] [2022-11-16 02:16:45,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 02:16:45,661 INFO L208 MainTranslator]: Completed translation [2022-11-16 02:16:45,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:16:45 WrapperNode [2022-11-16 02:16:45,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 02:16:45,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 02:16:45,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 02:16:45,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 02:16:45,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:16:45" (1/1) ... [2022-11-16 02:16:45,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:16:45" (1/1) ... [2022-11-16 02:16:45,700 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 164 [2022-11-16 02:16:45,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 02:16:45,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 02:16:45,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 02:16:45,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 02:16:45,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:16:45" (1/1) ... [2022-11-16 02:16:45,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:16:45" (1/1) ... [2022-11-16 02:16:45,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:16:45" (1/1) ... [2022-11-16 02:16:45,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:16:45" (1/1) ... [2022-11-16 02:16:45,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:16:45" (1/1) ... [2022-11-16 02:16:45,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:16:45" (1/1) ... [2022-11-16 02:16:45,723 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:16:45" (1/1) ... [2022-11-16 02:16:45,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:16:45" (1/1) ... [2022-11-16 02:16:45,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 02:16:45,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 02:16:45,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 02:16:45,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 02:16:45,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:16:45" (1/1) ... [2022-11-16 02:16:45,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 02:16:45,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:16:45,754 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 02:16:45,756 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 02:16:45,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 02:16:45,779 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 02:16:45,779 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 02:16:45,779 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 02:16:45,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 02:16:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 02:16:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 02:16:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 02:16:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 02:16:45,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 02:16:45,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 02:16:45,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 02:16:45,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 02:16:45,784 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 02:16:45,857 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 02:16:45,858 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 02:16:46,102 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 02:16:46,108 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 02:16:46,108 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 02:16:46,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 02:16:46 BoogieIcfgContainer [2022-11-16 02:16:46,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 02:16:46,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 02:16:46,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 02:16:46,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 02:16:46,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:16:45" (1/3) ... [2022-11-16 02:16:46,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77739fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:16:46, skipping insertion in model container [2022-11-16 02:16:46,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:16:45" (2/3) ... [2022-11-16 02:16:46,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77739fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:16:46, skipping insertion in model container [2022-11-16 02:16:46,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 02:16:46" (3/3) ... [2022-11-16 02:16:46,119 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2022-11-16 02:16:46,125 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 02:16:46,134 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 02:16:46,134 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 02:16:46,134 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 02:16:46,234 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 02:16:46,279 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 02:16:46,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 02:16:46,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:16:46,281 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 02:16:46,297 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 02:16:46,306 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 02:16:46,316 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-11-16 02:16:46,324 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;@630c3af3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 02:16:46,324 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 02:16:46,491 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:16:46,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:16:46,496 INFO L85 PathProgramCache]: Analyzing trace with hash 820603917, now seen corresponding path program 1 times [2022-11-16 02:16:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:16:46,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273869542] [2022-11-16 02:16:46,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:16:46,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:16:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:16:46,677 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 02:16:46,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:16:46,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273869542] [2022-11-16 02:16:46,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273869542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:16:46,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:16:46,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 02:16:46,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33430086] [2022-11-16 02:16:46,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:16:46,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 02:16:46,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:16:46,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 02:16:46,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 02:16:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:46,702 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:16:46,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 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 02:16:46,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:46,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:46,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 02:16:46,723 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:16:46,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:16:46,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1340591251, now seen corresponding path program 1 times [2022-11-16 02:16:46,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:16:46,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503983443] [2022-11-16 02:16:46,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:16:46,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:16:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:16:47,109 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 02:16:47,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:16:47,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503983443] [2022-11-16 02:16:47,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503983443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:16:47,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:16:47,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 02:16:47,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872905241] [2022-11-16 02:16:47,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:16:47,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 02:16:47,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:16:47,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 02:16:47,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 02:16:47,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:47,116 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:16:47,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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 02:16:47,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:47,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:47,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:47,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 02:16:47,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 02:16:47,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:16:47,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:16:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash -109189618, now seen corresponding path program 1 times [2022-11-16 02:16:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:16:47,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981087894] [2022-11-16 02:16:47,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:16:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:16:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:16:47,511 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 02:16:47,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:16:47,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981087894] [2022-11-16 02:16:47,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981087894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:16:47,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:16:47,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 02:16:47,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482953092] [2022-11-16 02:16:47,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:16:47,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 02:16:47,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:16:47,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 02:16:47,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 02:16:47,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:47,514 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:16:47,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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 02:16:47,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:47,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 02:16:47,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:16:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:16:47,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 02:16:47,591 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:16:47,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:16:47,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1688165216, now seen corresponding path program 1 times [2022-11-16 02:16:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:16:47,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281638133] [2022-11-16 02:16:47,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:16:47,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:16:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:16:47,761 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 02:16:47,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:16:47,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281638133] [2022-11-16 02:16:47,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281638133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 02:16:47,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280684218] [2022-11-16 02:16:47,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:16:47,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:16:47,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:16:47,767 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 02:16:47,768 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 02:16:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:16:47,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 02:16:47,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 02:16:47,963 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 02:16:47,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 02:16:48,044 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 02:16:48,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280684218] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 02:16:48,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 02:16:48,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2022-11-16 02:16:48,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861956216] [2022-11-16 02:16:48,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:16:48,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 02:16:48,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:16:48,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 02:16:48,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-16 02:16:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:48,046 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:16:48,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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 02:16:48,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:48,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:16:48,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:16:48,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:48,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:16:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:16:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:16:48,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 02:16:48,319 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,SelfDestructingSolverStorable3 [2022-11-16 02:16:48,320 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:16:48,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:16:48,320 INFO L85 PathProgramCache]: Analyzing trace with hash 375372065, now seen corresponding path program 1 times [2022-11-16 02:16:48,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:16:48,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976934720] [2022-11-16 02:16:48,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:16:48,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:16:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:16:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 02:16:48,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:16:48,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976934720] [2022-11-16 02:16:48,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976934720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:16:48,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:16:48,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 02:16:48,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895253820] [2022-11-16 02:16:48,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:16:48,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 02:16:48,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:16:48,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 02:16:48,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 02:16:48,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:48,501 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:16:48,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 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 02:16:48,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:48,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:16:48,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:16:48,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:16:48,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:48,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:48,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:16:48,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:16:48,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:16:48,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 02:16:48,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 02:16:48,579 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:16:48,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:16:48,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1431733608, now seen corresponding path program 1 times [2022-11-16 02:16:48,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:16:48,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810167861] [2022-11-16 02:16:48,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:16:48,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:16:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:16:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 02:16:49,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:16:49,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810167861] [2022-11-16 02:16:49,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810167861] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 02:16:49,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536827334] [2022-11-16 02:16:49,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:16:49,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:16:49,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:16:49,028 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 02:16:49,054 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 02:16:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:16:49,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 02:16:49,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 02:16:50,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 02:16:50,245 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 02:16:50,246 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 17 treesize of output 10 [2022-11-16 02:16:50,326 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 02:16:50,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 02:16:51,022 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-16 02:16:51,022 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 19 treesize of output 11 [2022-11-16 02:16:51,697 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 02:16:51,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536827334] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 02:16:51,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 02:16:51,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 20] total 46 [2022-11-16 02:16:51,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387550875] [2022-11-16 02:16:51,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 02:16:51,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-16 02:16:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:16:51,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-16 02:16:51,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1889, Unknown=0, NotChecked=0, Total=2070 [2022-11-16 02:16:51,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:51,709 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:16:51,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 10.23913043478261) internal successors, (471), 46 states have internal predecessors, (471), 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 02:16:51,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:51,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:16:51,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:16:51,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:16:51,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 02:16:51,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:16:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:16:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:16:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:16:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 02:16:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-16 02:16:53,605 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 02:16:53,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:16:53,801 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:16:53,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:16:53,801 INFO L85 PathProgramCache]: Analyzing trace with hash -507880441, now seen corresponding path program 2 times [2022-11-16 02:16:53,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:16:53,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385402781] [2022-11-16 02:16:53,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:16:53,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:16:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:16:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 02:16:58,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:16:58,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385402781] [2022-11-16 02:16:58,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385402781] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 02:16:58,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906776018] [2022-11-16 02:16:58,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 02:16:58,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:16:58,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:16:58,220 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 02:16:58,222 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 02:16:58,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 02:16:58,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 02:16:58,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 02:16:58,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 02:16:58,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 02:16:58,857 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 02:16:58,921 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 02:16:59,837 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-16 02:16:59,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-11-16 02:16:59,969 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 02:16:59,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 02:17:00,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_112 (Array Int Int))) (or (< ~x1~0 0) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (<= c_~size~0 ~x2~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) c_~f~0.base))) (= (select .cse0 (+ (* ~x1~0 4) c_~f~0.offset)) (select .cse0 (+ c_~f~0.offset (* ~x2~0 4))))))) is different from false [2022-11-16 02:17:01,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_111 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (or (< ~x1~0 0) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) c_~f~0.base))) (= (select .cse0 (+ (* ~x1~0 4) c_~f~0.offset)) (select .cse0 (+ c_~f~0.offset (* ~x2~0 4))))) (<= c_~size~0 ~x2~0))) is different from false [2022-11-16 02:17:01,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_111 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (or (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_#t~ret15#1.base|))) (= (select .cse0 (+ (* ~x1~0 4) |c_ULTIMATE.start_main_#t~ret15#1.offset|)) (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret15#1.offset| (* ~x2~0 4))))) (< ~x1~0 0) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) is different from false [2022-11-16 02:17:01,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_111 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (or (< ~x1~0 0) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (<= c_~size~0 ~x2~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (select .cse0 (+ (* ~x2~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse0 (+ (* ~x1~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) is different from false [2022-11-16 02:17:02,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 02:17:02,043 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 44 [2022-11-16 02:17:02,052 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-16 02:17:02,053 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 94 treesize of output 85 [2022-11-16 02:17:02,062 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 02:17:02,063 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 78 treesize of output 54 [2022-11-16 02:17:02,072 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 02:17:02,072 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 32 treesize of output 20 [2022-11-16 02:17:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 02:17:02,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906776018] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 02:17:02,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 02:17:02,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 29, 26] total 59 [2022-11-16 02:17:02,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645670177] [2022-11-16 02:17:02,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 02:17:02,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-16 02:17:02,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:17:02,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-16 02:17:02,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=2691, Unknown=19, NotChecked=436, Total=3422 [2022-11-16 02:17:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:17:02,272 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:17:02,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 8.457627118644067) internal successors, (499), 59 states have internal predecessors, (499), 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 02:17:02,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:17:02,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:17:02,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:17:02,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:17:02,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 02:17:02,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-11-16 02:17:02,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:17:05,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 02:17:18,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:17:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:17:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:17:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:17:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 02:17:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-16 02:17:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-16 02:17:18,213 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 02:17:18,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:17:18,409 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:17:18,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:17:18,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1797074681, now seen corresponding path program 3 times [2022-11-16 02:17:18,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:17:18,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545232095] [2022-11-16 02:17:18,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:17:18,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:17:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:17:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 02:17:19,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:17:19,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545232095] [2022-11-16 02:17:19,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545232095] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 02:17:19,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400888126] [2022-11-16 02:17:19,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 02:17:19,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:17:19,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:17:19,147 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 02:17:19,149 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 02:17:19,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 02:17:19,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 02:17:19,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 02:17:19,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 02:17:19,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 02:17:19,762 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 02:17:19,807 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 02:17:21,111 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-16 02:17:21,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-11-16 02:17:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-16 02:17:21,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 02:17:22,544 WARN L833 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_140 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_140) c_~f~0.base))) (= (select .cse0 (+ (* ~x1~0 4) c_~f~0.offset)) (select .cse0 (+ c_~f~0.offset (* ~x2~0 4))))) (< ~x1~0 0) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) is different from false [2022-11-16 02:17:22,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_139 (Array Int Int)) (~x1~0 Int) (~x2~0 Int) (v_ArrVal_140 (Array Int Int))) (or (< ~x1~0 0) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_140) c_~f~0.base))) (= (select .cse0 (+ (* ~x1~0 4) c_~f~0.offset)) (select .cse0 (+ c_~f~0.offset (* ~x2~0 4))))) (<= c_~size~0 ~x2~0))) is different from false [2022-11-16 02:17:22,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_139 (Array Int Int)) (~x1~0 Int) (~x2~0 Int) (v_ArrVal_140 (Array Int Int))) (or (< ~x1~0 0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_140) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (select .cse0 (+ (* ~x2~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse0 (+ (* ~x1~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) is different from false [2022-11-16 02:17:22,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_139 (Array Int Int)) (~x1~0 Int) (~x2~0 Int) (v_ArrVal_140 (Array Int Int))) (or (< ~x1~0 0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_140) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (select .cse0 (+ (* ~x1~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse0 (+ (* ~x2~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) is different from false [2022-11-16 02:17:23,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 02:17:23,133 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 44 [2022-11-16 02:17:23,141 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-16 02:17:23,142 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 198 treesize of output 173 [2022-11-16 02:17:23,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 02:17:23,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 59 [2022-11-16 02:17:23,153 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 02:17:23,153 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 142 treesize of output 94 [2022-11-16 02:17:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-16 02:17:23,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400888126] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 02:17:23,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 02:17:23,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29, 26] total 68 [2022-11-16 02:17:23,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119417387] [2022-11-16 02:17:23,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 02:17:23,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-16 02:17:23,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:17:23,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-16 02:17:23,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=3750, Unknown=14, NotChecked=508, Total=4556 [2022-11-16 02:17:23,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:17:23,350 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:17:23,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 8.75) internal successors, (595), 68 states have internal predecessors, (595), 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 02:17:23,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:17:23,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:17:23,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:17:23,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:17:23,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 02:17:23,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-11-16 02:17:23,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2022-11-16 02:17:23,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:17:53,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:17:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:17:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:17:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:17:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 02:17:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2022-11-16 02:17:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-16 02:17:53,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-11-16 02:17:53,263 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 02:17:53,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:17:53,460 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:17:53,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:17:53,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2059727351, now seen corresponding path program 4 times [2022-11-16 02:17:53,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:17:53,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011349766] [2022-11-16 02:17:53,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:17:53,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:17:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:17:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 02:17:54,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:17:54,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011349766] [2022-11-16 02:17:54,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011349766] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 02:17:54,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488947141] [2022-11-16 02:17:54,224 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 02:17:54,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:17:54,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:17:54,225 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 02:17:54,227 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 02:17:54,322 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 02:17:54,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 02:17:54,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-16 02:17:54,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 02:17:54,966 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 02:17:54,966 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 20 [2022-11-16 02:17:55,774 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 02:17:55,775 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 26 treesize of output 13 [2022-11-16 02:17:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 02:17:55,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 02:17:56,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 02:17:56,450 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 34 treesize of output 22 [2022-11-16 02:17:57,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 02:17:57,187 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 44 [2022-11-16 02:17:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 02:17:58,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488947141] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 02:17:58,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 02:17:58,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 28, 28] total 60 [2022-11-16 02:17:58,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527036099] [2022-11-16 02:17:58,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 02:17:58,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-16 02:17:58,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:17:58,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-16 02:17:58,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=3252, Unknown=0, NotChecked=0, Total=3540 [2022-11-16 02:17:58,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:17:58,125 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:17:58,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 8.7) internal successors, (522), 60 states have internal predecessors, (522), 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 02:17:58,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:17:58,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:17:58,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:17:58,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:17:58,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 02:17:58,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 193 states. [2022-11-16 02:17:58,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2022-11-16 02:17:58,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2022-11-16 02:17:58,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:18:45,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:18:55,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:19:03,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:19:51,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:19:58,813 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 85 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 02:20:04,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:20:05,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:20:11,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:20:15,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:20:17,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:20:33,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:20:36,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:20:38,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:20:40,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:20:41,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:20:44,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:20:46,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:20:57,562 WARN L233 SmtUtils]: Spent 7.84s on a formula simplification. DAG size of input: 98 DAG size of output: 87 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 02:21:07,589 WARN L233 SmtUtils]: Spent 8.31s on a formula simplification. DAG size of input: 79 DAG size of output: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 02:21:09,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:21:18,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:21:20,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:21:27,582 WARN L233 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 82 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 02:21:30,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:21:32,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:22:28,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:23:14,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:23:16,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:23:18,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:23:21,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:23:31,260 WARN L233 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 82 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 02:23:37,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:23:40,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:23:58,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:24:14,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:24:16,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:24:18,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:24:34,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:24:39,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:25:00,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 02:25:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:25:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:25:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:25:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:25:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 02:25:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2022-11-16 02:25:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-16 02:25:28,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-11-16 02:25:28,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2022-11-16 02:25:28,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-16 02:25:29,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:25:29,047 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:25:29,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:25:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash 800306811, now seen corresponding path program 5 times [2022-11-16 02:25:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:25:29,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640535574] [2022-11-16 02:25:29,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:25:29,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:25:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:25:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 02:25:29,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:25:29,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640535574] [2022-11-16 02:25:29,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640535574] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 02:25:29,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553979248] [2022-11-16 02:25:29,686 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 02:25:29,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:25:29,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:25:29,687 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 02:25:29,689 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 02:25:29,944 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-16 02:25:29,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 02:25:29,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-16 02:25:29,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 02:25:33,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 02:25:33,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 02:25:33,789 INFO L321 Elim1Store]: treesize reduction 3, result has 70.0 percent of original size [2022-11-16 02:25:33,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 19 [2022-11-16 02:25:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 53 proven. 34 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 02:25:33,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 02:25:37,064 INFO L321 Elim1Store]: treesize reduction 5, result has 97.8 percent of original size [2022-11-16 02:25:37,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 128 treesize of output 271 [2022-11-16 02:25:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 80 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 02:25:42,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553979248] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 02:25:42,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 02:25:42,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 43, 38] total 95 [2022-11-16 02:25:42,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248465630] [2022-11-16 02:25:42,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 02:25:42,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-11-16 02:25:42,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:25:42,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-11-16 02:25:42,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=625, Invalid=8305, Unknown=0, NotChecked=0, Total=8930 [2022-11-16 02:25:42,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:25:42,538 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:25:42,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 7.505263157894737) internal successors, (713), 95 states have internal predecessors, (713), 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 02:25:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:25:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:25:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:25:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:25:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 02:25:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 193 states. [2022-11-16 02:25:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2022-11-16 02:25:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2022-11-16 02:25:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 236 states. [2022-11-16 02:25:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:27:22,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 02:28:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:28:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:28:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:28:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:28:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 02:28:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2022-11-16 02:28:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-16 02:28:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-11-16 02:28:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 286 states. [2022-11-16 02:28:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 270 states. [2022-11-16 02:28:12,599 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 02:28:12,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:28:12,799 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:28:12,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:28:12,799 INFO L85 PathProgramCache]: Analyzing trace with hash 259740607, now seen corresponding path program 6 times [2022-11-16 02:28:12,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:28:12,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116315904] [2022-11-16 02:28:12,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:28:12,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:28:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:28:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 02:28:13,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:28:13,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116315904] [2022-11-16 02:28:13,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116315904] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 02:28:13,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083750763] [2022-11-16 02:28:13,513 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 02:28:13,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:28:13,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:28:13,514 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 02:28:13,516 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 02:28:13,644 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-16 02:28:13,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 02:28:13,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 02:28:13,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 02:28:13,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 02:28:14,112 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 02:28:14,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 02:28:14,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 02:28:15,475 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-16 02:28:15,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-11-16 02:28:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-16 02:28:15,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 02:28:16,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (~x2~0 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) c_~f~0.base) (+ c_~f~0.offset (* ~x2~0 4))) (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~x1~0 4) c_~f~0.offset))) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) is different from false [2022-11-16 02:28:17,289 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_215 (Array Int Int)) (~x1~0 Int) (~x2~0 Int)) (or (< ~x1~0 0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_215))) (= (select (select .cse0 |c_ULTIMATE.start_main_#t~ret15#1.base|) (+ (* ~x1~0 4) |c_ULTIMATE.start_main_#t~ret15#1.offset|)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_#t~ret15#1.base|) (+ |c_ULTIMATE.start_main_#t~ret15#1.offset| (* ~x2~0 4))))) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) is different from false [2022-11-16 02:28:17,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_215 (Array Int Int)) (~x1~0 Int) (~x2~0 Int)) (or (< ~x1~0 0) (<= c_~size~0 ~x1~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_215))) (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~x1~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~x2~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) is different from false [2022-11-16 02:28:17,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 02:28:17,710 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 52 treesize of output 41 [2022-11-16 02:28:17,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 02:28:17,729 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 414 treesize of output 330 [2022-11-16 02:28:17,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 02:28:17,738 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 318 treesize of output 258 [2022-11-16 02:28:17,744 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 246 treesize of output 198 [2022-11-16 02:28:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 26 refuted. 6 times theorem prover too weak. 70 trivial. 4 not checked. [2022-11-16 02:28:18,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083750763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 02:28:18,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 02:28:18,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29, 29] total 71 [2022-11-16 02:28:18,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170289669] [2022-11-16 02:28:18,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 02:28:18,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-16 02:28:18,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:28:18,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-16 02:28:18,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=4293, Unknown=61, NotChecked=402, Total=4970 [2022-11-16 02:28:18,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:28:18,366 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:28:18,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 8.56338028169014) internal successors, (608), 71 states have internal predecessors, (608), 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 02:28:18,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:28:18,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:28:18,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:28:18,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:28:18,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 02:28:18,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 193 states. [2022-11-16 02:28:18,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2022-11-16 02:28:18,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2022-11-16 02:28:18,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 286 states. [2022-11-16 02:28:18,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 270 states. [2022-11-16 02:28:18,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:28:28,962 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~f~0.base))) (let ((.cse0 (forall ((v_ArrVal_216 (Array Int Int)) (~x2~0 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) c_~f~0.base) (+ c_~f~0.offset (* ~x2~0 4))) (select .cse1 (+ (* c_~x1~0 4) c_~f~0.offset))) (< ~x2~0 0) (<= c_~size~0 ~x2~0))))) (and (or (= |c_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse0) (or .cse0 (= |c_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) .cse0 (= |c_thread1Thread1of1ForFork0_~i~0#1| 0) (forall ((~x1~0 Int)) (or (< ~x1~0 0) (forall ((v_ArrVal_216 (Array Int Int)) (~x2~0 Int)) (or (< ~x2~0 0) (<= c_~size~0 ~x2~0) (= (select .cse1 (+ (* ~x1~0 4) c_~f~0.offset)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) c_~f~0.base) (+ c_~f~0.offset (* ~x2~0 4)))))) (<= c_~size~0 ~x1~0)))))) is different from false [2022-11-16 02:28:31,105 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~f~0.base))) (and (forall ((~x2~0 Int)) (or (= (select .cse0 (+ c_~f~0.offset (* ~x2~0 4))) c_~x1~0) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) (forall ((v_ArrVal_216 (Array Int Int)) (~x2~0 Int)) (or (< ~x2~0 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) c_~f~0.base) (+ c_~f~0.offset (* ~x2~0 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (<= c_~size~0 ~x2~0))) (= |c_thread1Thread1of1ForFork0_~i~0#1| 0) (forall ((~x1~0 Int)) (or (< ~x1~0 0) (forall ((v_ArrVal_216 (Array Int Int)) (~x2~0 Int)) (or (< ~x2~0 0) (<= c_~size~0 ~x2~0) (= (select .cse0 (+ (* ~x1~0 4) c_~f~0.offset)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) c_~f~0.base) (+ c_~f~0.offset (* ~x2~0 4)))))) (<= c_~size~0 ~x1~0))))) is different from false [2022-11-16 02:28:31,109 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~f~0.base))) (and (forall ((~x2~0 Int)) (or (= (select .cse0 (+ c_~f~0.offset (* ~x2~0 4))) c_~x1~0) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) (= |c_thread1Thread1of1ForFork0_~i~0#1| 0) (forall ((~x1~0 Int)) (or (< ~x1~0 0) (forall ((v_ArrVal_216 (Array Int Int)) (~x2~0 Int)) (or (< ~x2~0 0) (<= c_~size~0 ~x2~0) (= (select .cse0 (+ (* ~x1~0 4) c_~f~0.offset)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) c_~f~0.base) (+ c_~f~0.offset (* ~x2~0 4)))))) (<= c_~size~0 ~x1~0))))) is different from false [2022-11-16 02:28:31,416 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (<= 1 |c_thread1Thread1of1ForFork0_~i~0#1|) (forall ((~x1~0 Int)) (or (< ~x1~0 0) (forall ((v_ArrVal_216 (Array Int Int)) (~x2~0 Int)) (or (< ~x2~0 0) (<= c_~size~0 ~x2~0) (= (select (select |c_#memory_int| c_~f~0.base) (+ (* ~x1~0 4) c_~f~0.offset)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) c_~f~0.base) (+ c_~f~0.offset (* ~x2~0 4)))))) (<= c_~size~0 ~x1~0)))) is different from false [2022-11-16 02:28:31,751 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~f~0.base))) (let ((.cse0 (forall ((v_ArrVal_216 (Array Int Int)) (~x2~0 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) c_~f~0.base) (+ c_~f~0.offset (* ~x2~0 4))) (select .cse1 (+ (* c_~x1~0 4) c_~f~0.offset))) (< ~x2~0 0) (<= c_~size~0 ~x2~0))))) (and (or (= |c_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse0) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (<= 1 |c_thread1Thread1of1ForFork0_~i~0#1|) (or .cse0 (= |c_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) .cse0 (forall ((~x1~0 Int)) (or (< ~x1~0 0) (forall ((v_ArrVal_216 (Array Int Int)) (~x2~0 Int)) (or (< ~x2~0 0) (<= c_~size~0 ~x2~0) (= (select .cse1 (+ (* ~x1~0 4) c_~f~0.offset)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) c_~f~0.base) (+ c_~f~0.offset (* ~x2~0 4)))))) (<= c_~size~0 ~x1~0)))))) is different from false [2022-11-16 02:28:40,290 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread1Thread1of1ForFork0_~i~0#1| 3) (forall ((v_ArrVal_216 (Array Int Int)) (~x2~0 Int)) (or (< ~x2~0 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) c_~f~0.base) (+ c_~f~0.offset (* ~x2~0 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (<= c_~size~0 ~x2~0))) (<= 3 |c_thread1Thread1of1ForFork0_~i~0#1|) (forall ((~x1~0 Int)) (or (< ~x1~0 0) (forall ((v_ArrVal_216 (Array Int Int)) (~x2~0 Int)) (or (< ~x2~0 0) (<= c_~size~0 ~x2~0) (= (select (select |c_#memory_int| c_~f~0.base) (+ (* ~x1~0 4) c_~f~0.offset)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) c_~f~0.base) (+ c_~f~0.offset (* ~x2~0 4)))))) (<= c_~size~0 ~x1~0)))) is different from false [2022-11-16 02:28:41,076 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~f~0.base))) (and (forall ((~x2~0 Int)) (or (= (select .cse0 (+ c_~f~0.offset (* ~x2~0 4))) c_~x1~0) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) (forall ((~x1~0 Int)) (or (< ~x1~0 0) (forall ((v_ArrVal_216 (Array Int Int)) (~x2~0 Int)) (or (< ~x2~0 0) (<= c_~size~0 ~x2~0) (= (select .cse0 (+ (* ~x1~0 4) c_~f~0.offset)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) c_~f~0.base) (+ c_~f~0.offset (* ~x2~0 4)))))) (<= c_~size~0 ~x1~0))))) is different from false [2022-11-16 02:30:47,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:30:47,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:30:47,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 02:30:47,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 02:30:47,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 02:30:47,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2022-11-16 02:30:47,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-11-16 02:30:47,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-11-16 02:30:47,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 306 states. [2022-11-16 02:30:47,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 300 states. [2022-11-16 02:30:47,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2022-11-16 02:30:47,204 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 02:30:47,403 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,SelfDestructingSolverStorable10 [2022-11-16 02:30:47,404 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 02:30:47,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:30:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1184589727, now seen corresponding path program 7 times [2022-11-16 02:30:47,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:30:47,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345590620] [2022-11-16 02:30:47,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:30:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:30:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:30:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 02:30:49,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:30:49,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345590620] [2022-11-16 02:30:49,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345590620] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 02:30:49,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838207051] [2022-11-16 02:30:49,222 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 02:30:49,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:30:49,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:30:49,223 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 02:30:49,225 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 02:30:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:30:49,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-16 02:30:49,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 02:30:49,453 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 02:30:49,501 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 02:30:49,501 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 02:30:49,846 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 02:30:49,846 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 02:30:50,068 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 02:30:50,221 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 02:30:50,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 02:30:50,739 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 02:30:53,682 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-16 02:30:53,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 44 [2022-11-16 02:30:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 02:30:53,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-11-16 02:31:00,979 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 02:31:00,979 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 02:31:00,979 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 02:31:00,981 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 02:31:00,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-16 02:31:01,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 02:31:01,182 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 211 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 105 known predicates. [2022-11-16 02:31:01,186 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2022-11-16 02:31:01,187 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2022-11-16 02:31:01,188 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 02:31:01,188 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 02:31:01,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 02:31:01 BasicIcfg [2022-11-16 02:31:01,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 02:31:01,190 INFO L158 Benchmark]: Toolchain (without parser) took 855767.29ms. Allocated memory was 202.4MB in the beginning and 532.7MB in the end (delta: 330.3MB). Free memory was 145.6MB in the beginning and 258.2MB in the end (delta: -112.5MB). Peak memory consumption was 219.3MB. Max. memory is 8.0GB. [2022-11-16 02:31:01,190 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 202.4MB. Free memory is still 162.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-16 02:31:01,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.55ms. Allocated memory was 202.4MB in the beginning and 255.9MB in the end (delta: 53.5MB). Free memory was 179.8MB in the beginning and 228.8MB in the end (delta: -49.0MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-11-16 02:31:01,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.76ms. Allocated memory is still 255.9MB. Free memory was 228.8MB in the beginning and 226.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-16 02:31:01,190 INFO L158 Benchmark]: Boogie Preprocessor took 24.41ms. Allocated memory is still 255.9MB. Free memory was 226.1MB in the beginning and 224.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-16 02:31:01,190 INFO L158 Benchmark]: RCFGBuilder took 383.68ms. Allocated memory is still 255.9MB. Free memory was 224.6MB in the beginning and 206.2MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-11-16 02:31:01,191 INFO L158 Benchmark]: TraceAbstraction took 855078.48ms. Allocated memory was 255.9MB in the beginning and 532.7MB in the end (delta: 276.8MB). Free memory was 205.7MB in the beginning and 258.2MB in the end (delta: -52.5MB). Peak memory consumption was 225.4MB. Max. memory is 8.0GB. [2022-11-16 02:31:01,191 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.26ms. Allocated memory is still 202.4MB. Free memory is still 162.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.55ms. Allocated memory was 202.4MB in the beginning and 255.9MB in the end (delta: 53.5MB). Free memory was 179.8MB in the beginning and 228.8MB in the end (delta: -49.0MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.76ms. Allocated memory is still 255.9MB. Free memory was 228.8MB in the beginning and 226.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.41ms. Allocated memory is still 255.9MB. Free memory was 226.1MB in the beginning and 224.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 383.68ms. Allocated memory is still 255.9MB. Free memory was 224.6MB in the beginning and 206.2MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 855078.48ms. Allocated memory was 255.9MB in the beginning and 532.7MB in the end (delta: 276.8MB). Free memory was 205.7MB in the beginning and 258.2MB in the end (delta: -52.5MB). Peak memory consumption was 225.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 328631, independent: 310534, independent conditional: 302351, independent unconditional: 8183, dependent: 18097, dependent conditional: 18088, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 310547, independent: 310534, independent conditional: 302351, independent unconditional: 8183, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 310547, independent: 310534, independent conditional: 302351, independent unconditional: 8183, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 310586, independent: 310534, independent conditional: 8, independent unconditional: 310526, dependent: 52, dependent conditional: 31, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 310586, independent: 310534, independent conditional: 8, independent unconditional: 310526, dependent: 52, dependent conditional: 22, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 310586, independent: 310534, independent conditional: 8, independent unconditional: 310526, dependent: 52, dependent conditional: 22, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5143, independent: 5122, independent conditional: 6, independent unconditional: 5116, dependent: 21, dependent conditional: 12, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5143, independent: 5115, independent conditional: 0, independent unconditional: 5115, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 28, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 21, dependent conditional: 12, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 21, dependent conditional: 12, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 368, independent: 58, independent conditional: 19, independent unconditional: 39, dependent: 310, dependent conditional: 276, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 310586, independent: 305412, independent conditional: 2, independent unconditional: 305410, dependent: 31, dependent conditional: 10, dependent unconditional: 21, unknown: 5143, unknown conditional: 18, unknown unconditional: 5125] , Statistics on independence cache: Total cache size (in pairs): 5143, Positive cache size: 5122, Positive conditional cache size: 6, Positive unconditional cache size: 5116, Negative cache size: 21, Negative conditional cache size: 12, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 7, Independence queries for same thread: 18084 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 4202, Number of trivial persistent sets: 4184, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8192, independent: 8183, independent conditional: 0, independent unconditional: 8183, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 328631, independent: 310534, independent conditional: 302351, independent unconditional: 8183, dependent: 18097, dependent conditional: 18088, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 310547, independent: 310534, independent conditional: 302351, independent unconditional: 8183, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 310547, independent: 310534, independent conditional: 302351, independent unconditional: 8183, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 310586, independent: 310534, independent conditional: 8, independent unconditional: 310526, dependent: 52, dependent conditional: 31, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 310586, independent: 310534, independent conditional: 8, independent unconditional: 310526, dependent: 52, dependent conditional: 22, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 310586, independent: 310534, independent conditional: 8, independent unconditional: 310526, dependent: 52, dependent conditional: 22, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5143, independent: 5122, independent conditional: 6, independent unconditional: 5116, dependent: 21, dependent conditional: 12, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5143, independent: 5115, independent conditional: 0, independent unconditional: 5115, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 28, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 21, dependent conditional: 12, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 21, dependent conditional: 12, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 368, independent: 58, independent conditional: 19, independent unconditional: 39, dependent: 310, dependent conditional: 276, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 310586, independent: 305412, independent conditional: 2, independent unconditional: 305410, dependent: 31, dependent conditional: 10, dependent unconditional: 21, unknown: 5143, unknown conditional: 18, unknown unconditional: 5125] , Statistics on independence cache: Total cache size (in pairs): 5143, Positive cache size: 5122, Positive conditional cache size: 6, Positive unconditional cache size: 5116, Negative cache size: 21, Negative conditional cache size: 12, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 7, Independence queries for same thread: 18084 - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 211 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 105 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 287 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 854.9s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 797.9s, 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: 1212, 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.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 40.1s InterpolantComputationTime, 3440 NumberOfCodeBlocks, 3265 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 4873 ConstructedInterpolants, 1132 QuantifiedInterpolants, 66996 SizeOfPredicates, 226 NumberOfNonLiveVariables, 2400 ConjunctsInSsa, 338 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 658/1071 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