./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4caa1f295436b297cae57f4102149db941e37f67b5d377cc8e9aa7b58bbf9350 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:06:33,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:06:33,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:06:33,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:06:33,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:06:33,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:06:33,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:06:33,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:06:33,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:06:33,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:06:33,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:06:33,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:06:33,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:06:33,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:06:33,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:06:33,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:06:33,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:06:33,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:06:33,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:06:33,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:06:33,657 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:06:33,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:06:33,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:06:33,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:06:33,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:06:33,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:06:33,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:06:33,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:06:33,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:06:33,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:06:33,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:06:33,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:06:33,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:06:33,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:06:33,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:06:33,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:06:33,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:06:33,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:06:33,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:06:33,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:06:33,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:06:33,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:06:33,674 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:06:33,698 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:06:33,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:06:33,701 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:06:33,701 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:06:33,702 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:06:33,702 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:06:33,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:06:33,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:06:33,703 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:06:33,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:06:33,703 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:06:33,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:06:33,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:06:33,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:06:33,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:06:33,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:06:33,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:06:33,704 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:06:33,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:06:33,706 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:06:33,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:06:33,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:06:33,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:06:33,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:06:33,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:06:33,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:06:33,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:06:33,707 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:06:33,707 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:06:33,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:06:33,708 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:06:33,708 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:06:33,708 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:06:33,708 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4caa1f295436b297cae57f4102149db941e37f67b5d377cc8e9aa7b58bbf9350 [2022-07-11 23:06:33,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:06:33,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:06:33,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:06:33,926 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:06:33,927 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:06:33,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c [2022-07-11 23:06:33,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61f800855/924c4794d5e24521bc67d34ed188b71b/FLAG39ca630b8 [2022-07-11 23:06:34,303 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:06:34,304 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c [2022-07-11 23:06:34,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61f800855/924c4794d5e24521bc67d34ed188b71b/FLAG39ca630b8 [2022-07-11 23:06:34,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61f800855/924c4794d5e24521bc67d34ed188b71b [2022-07-11 23:06:34,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:06:34,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:06:34,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:06:34,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:06:34,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:06:34,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:06:34" (1/1) ... [2022-07-11 23:06:34,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4175a6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:06:34, skipping insertion in model container [2022-07-11 23:06:34,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:06:34" (1/1) ... [2022-07-11 23:06:34,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:06:34,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:06:34,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c[415,428] [2022-07-11 23:06:34,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:06:34,895 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:06:34,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c[415,428] [2022-07-11 23:06:34,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:06:34,939 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:06:34,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:06:34 WrapperNode [2022-07-11 23:06:34,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:06:34,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:06:34,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:06:34,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:06:34,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:06:34" (1/1) ... [2022-07-11 23:06:34,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:06:34" (1/1) ... [2022-07-11 23:06:34,976 INFO L137 Inliner]: procedures = 15, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2022-07-11 23:06:34,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:06:34,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:06:34,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:06:34,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:06:34,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:06:34" (1/1) ... [2022-07-11 23:06:34,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:06:34" (1/1) ... [2022-07-11 23:06:34,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:06:34" (1/1) ... [2022-07-11 23:06:34,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:06:34" (1/1) ... [2022-07-11 23:06:34,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:06:34" (1/1) ... [2022-07-11 23:06:35,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:06:34" (1/1) ... [2022-07-11 23:06:35,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:06:34" (1/1) ... [2022-07-11 23:06:35,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:06:35,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:06:35,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:06:35,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:06:35,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:06:34" (1/1) ... [2022-07-11 23:06:35,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:06:35,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:06:35,046 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-07-11 23:06:35,065 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-07-11 23:06:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:06:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-11 23:06:35,075 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-11 23:06:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:06:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 23:06:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:06:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:06:35,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:06:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:06:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 23:06:35,117 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:06:35,118 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:06:35,226 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:06:35,230 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:06:35,230 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-11 23:06:35,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:06:35 BoogieIcfgContainer [2022-07-11 23:06:35,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:06:35,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:06:35,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:06:35,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:06:35,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:06:34" (1/3) ... [2022-07-11 23:06:35,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c218b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:06:35, skipping insertion in model container [2022-07-11 23:06:35,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:06:34" (2/3) ... [2022-07-11 23:06:35,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c218b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:06:35, skipping insertion in model container [2022-07-11 23:06:35,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:06:35" (3/3) ... [2022-07-11 23:06:35,238 INFO L111 eAbstractionObserver]: Analyzing ICFG array_init_pair_symmetr2.c [2022-07-11 23:06:35,247 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:06:35,263 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:06:35,310 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:06:35,315 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47871321, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52ad00ce [2022-07-11 23:06:35,316 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:06:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-11 23:06:35,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-11 23:06:35,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:06:35,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:06:35,325 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:06:35,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:06:35,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1607472667, now seen corresponding path program 1 times [2022-07-11 23:06:35,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:06:35,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804968424] [2022-07-11 23:06:35,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:06:35,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:06:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:06:35,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:06:35,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804968424] [2022-07-11 23:06:35,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804968424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:06:35,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:06:35,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:06:35,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880648690] [2022-07-11 23:06:35,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:06:35,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:06:35,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:06:35,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:06:35,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:06:35,509 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-07-11 23:06:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:06:35,527 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-07-11 23:06:35,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:06:35,529 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2022-07-11 23:06:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:06:35,535 INFO L225 Difference]: With dead ends: 50 [2022-07-11 23:06:35,535 INFO L226 Difference]: Without dead ends: 22 [2022-07-11 23:06:35,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:06:35,541 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:06:35,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:06:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-11 23:06:35,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-11 23:06:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-11 23:06:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-11 23:06:35,572 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2022-07-11 23:06:35,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:06:35,572 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-11 23:06:35,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-07-11 23:06:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-11 23:06:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-11 23:06:35,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:06:35,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:06:35,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:06:35,576 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:06:35,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:06:35,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1898116011, now seen corresponding path program 1 times [2022-07-11 23:06:35,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:06:35,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945813795] [2022-07-11 23:06:35,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:06:35,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:06:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:06:35,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:06:35,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945813795] [2022-07-11 23:06:35,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945813795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:06:35,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:06:35,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:06:35,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709718148] [2022-07-11 23:06:35,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:06:35,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:06:35,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:06:35,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:06:35,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:06:35,675 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-07-11 23:06:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:06:35,744 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-07-11 23:06:35,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:06:35,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2022-07-11 23:06:35,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:06:35,745 INFO L225 Difference]: With dead ends: 40 [2022-07-11 23:06:35,745 INFO L226 Difference]: Without dead ends: 30 [2022-07-11 23:06:35,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:06:35,749 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:06:35,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 24 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:06:35,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-11 23:06:35,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-11 23:06:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-11 23:06:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-11 23:06:35,757 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 9 [2022-07-11 23:06:35,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:06:35,757 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-11 23:06:35,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-07-11 23:06:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-11 23:06:35,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 23:06:35,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:06:35,759 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:06:35,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:06:35,759 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:06:35,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:06:35,761 INFO L85 PathProgramCache]: Analyzing trace with hash 544146986, now seen corresponding path program 1 times [2022-07-11 23:06:35,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:06:35,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735914964] [2022-07-11 23:06:35,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:06:35,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:06:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:35,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:06:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:35,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-11 23:06:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:35,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:06:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 23:06:35,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:06:35,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735914964] [2022-07-11 23:06:35,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735914964] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:06:35,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30978059] [2022-07-11 23:06:35,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:06:35,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:06:35,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:06:35,885 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:06:35,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:06:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:35,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-11 23:06:35,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:06:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 23:06:36,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:06:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 23:06:36,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30978059] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:06:36,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:06:36,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2022-07-11 23:06:36,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205534279] [2022-07-11 23:06:36,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:06:36,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:06:36,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:06:36,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:06:36,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:06:36,050 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-11 23:06:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:06:36,173 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2022-07-11 23:06:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:06:36,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 29 [2022-07-11 23:06:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:06:36,175 INFO L225 Difference]: With dead ends: 72 [2022-07-11 23:06:36,175 INFO L226 Difference]: Without dead ends: 61 [2022-07-11 23:06:36,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:06:36,176 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 136 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:06:36,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 38 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:06:36,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-11 23:06:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2022-07-11 23:06:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-11 23:06:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2022-07-11 23:06:36,184 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 29 [2022-07-11 23:06:36,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:06:36,184 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2022-07-11 23:06:36,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-11 23:06:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-07-11 23:06:36,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-11 23:06:36,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:06:36,187 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:06:36,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:06:36,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:06:36,403 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:06:36,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:06:36,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1645511465, now seen corresponding path program 2 times [2022-07-11 23:06:36,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:06:36,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107351127] [2022-07-11 23:06:36,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:06:36,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:06:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:36,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:06:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:36,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-11 23:06:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:36,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:06:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:36,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-11 23:06:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:36,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-11 23:06:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:36,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-11 23:06:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:36,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-11 23:06:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:36,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-11 23:06:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:36,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-11 23:06:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-11 23:06:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:36,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-11 23:06:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:36,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-11 23:06:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-07-11 23:06:36,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:06:36,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107351127] [2022-07-11 23:06:36,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107351127] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:06:36,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394363331] [2022-07-11 23:06:36,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:06:36,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:06:36,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:06:36,548 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-07-11 23:06:36,571 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-07-11 23:06:36,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:06:36,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:06:36,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:06:36,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:06:36,788 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-07-11 23:06:36,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:06:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-07-11 23:06:36,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394363331] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:06:36,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:06:36,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 19 [2022-07-11 23:06:36,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014684906] [2022-07-11 23:06:36,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:06:36,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-11 23:06:36,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:06:36,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-11 23:06:36,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2022-07-11 23:06:36,908 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2022-07-11 23:06:37,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:06:37,182 INFO L93 Difference]: Finished difference Result 162 states and 206 transitions. [2022-07-11 23:06:37,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:06:37,183 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 89 [2022-07-11 23:06:37,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:06:37,185 INFO L225 Difference]: With dead ends: 162 [2022-07-11 23:06:37,185 INFO L226 Difference]: Without dead ends: 145 [2022-07-11 23:06:37,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2022-07-11 23:06:37,186 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 315 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:06:37,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 63 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:06:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-11 23:06:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2022-07-11 23:06:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-11 23:06:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2022-07-11 23:06:37,211 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 89 [2022-07-11 23:06:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:06:37,211 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2022-07-11 23:06:37,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2022-07-11 23:06:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2022-07-11 23:06:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-11 23:06:37,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:06:37,215 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:06:37,261 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-07-11 23:06:37,432 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-07-11 23:06:37,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:06:37,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:06:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash 548463335, now seen corresponding path program 3 times [2022-07-11 23:06:37,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:06:37,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270883514] [2022-07-11 23:06:37,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:06:37,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:06:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:06:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-11 23:06:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:06:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-11 23:06:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-11 23:06:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-11 23:06:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-11 23:06:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-11 23:06:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-11 23:06:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-11 23:06:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-11 23:06:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-11 23:06:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-11 23:06:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-11 23:06:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-11 23:06:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-11 23:06:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-11 23:06:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-11 23:06:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-11 23:06:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-11 23:06:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-11 23:06:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-11 23:06:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-11 23:06:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-11 23:06:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-11 23:06:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-11 23:06:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-11 23:06:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-11 23:06:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-11 23:06:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-11 23:06:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2120 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 1840 trivial. 0 not checked. [2022-07-11 23:06:37,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:06:37,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270883514] [2022-07-11 23:06:37,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270883514] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:06:37,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260741699] [2022-07-11 23:06:37,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:06:37,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:06:37,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:06:37,684 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-07-11 23:06:37,705 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-07-11 23:06:38,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-11 23:06:38,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:06:38,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-11 23:06:38,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:06:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2022-07-11 23:06:38,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:06:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2022-07-11 23:06:38,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260741699] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:06:38,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:06:38,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 37 [2022-07-11 23:06:38,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736395329] [2022-07-11 23:06:38,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:06:38,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-11 23:06:38,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:06:38,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-11 23:06:38,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2022-07-11 23:06:38,855 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 37 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 37 states have internal predecessors, (102), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2022-07-11 23:06:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:06:39,593 INFO L93 Difference]: Finished difference Result 342 states and 434 transitions. [2022-07-11 23:06:39,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-11 23:06:39,593 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 37 states have internal predecessors, (102), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 209 [2022-07-11 23:06:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:06:39,596 INFO L225 Difference]: With dead ends: 342 [2022-07-11 23:06:39,596 INFO L226 Difference]: Without dead ends: 313 [2022-07-11 23:06:39,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2022-07-11 23:06:39,598 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 677 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:06:39,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 131 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:06:39,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-11 23:06:39,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 192. [2022-07-11 23:06:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-07-11 23:06:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 259 transitions. [2022-07-11 23:06:39,621 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 259 transitions. Word has length 209 [2022-07-11 23:06:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:06:39,622 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 259 transitions. [2022-07-11 23:06:39,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 37 states have internal predecessors, (102), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2022-07-11 23:06:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 259 transitions. [2022-07-11 23:06:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2022-07-11 23:06:39,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:06:39,629 INFO L195 NwaCegarLoop]: trace histogram [66, 66, 66, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:06:39,647 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-07-11 23:06:39,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:06:39,847 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:06:39,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:06:39,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1915094685, now seen corresponding path program 4 times [2022-07-11 23:06:39,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:06:39,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410005479] [2022-07-11 23:06:39,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:06:39,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:06:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:06:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-11 23:06:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:06:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-11 23:06:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-11 23:06:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-11 23:06:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-11 23:06:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-11 23:06:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-11 23:06:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-11 23:06:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-11 23:06:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-11 23:06:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-11 23:06:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-11 23:06:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-11 23:06:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-11 23:06:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-11 23:06:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-11 23:06:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-11 23:06:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-11 23:06:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-11 23:06:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-11 23:06:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-11 23:06:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-11 23:06:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-11 23:06:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-11 23:06:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-11 23:06:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-11 23:06:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-11 23:06:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-11 23:06:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-11 23:06:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-11 23:06:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-11 23:06:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-11 23:06:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-11 23:06:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-11 23:06:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-11 23:06:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-11 23:06:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-11 23:06:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-11 23:06:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-11 23:06:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-11 23:06:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-11 23:06:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-11 23:06:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-07-11 23:06:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-07-11 23:06:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-07-11 23:06:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-11 23:06:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-11 23:06:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-11 23:06:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-07-11 23:06:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-07-11 23:06:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-07-11 23:06:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-07-11 23:06:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-07-11 23:06:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-07-11 23:06:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-07-11 23:06:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2022-07-11 23:06:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-07-11 23:06:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-07-11 23:06:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-11 23:06:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2022-07-11 23:06:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2022-07-11 23:06:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2022-07-11 23:06:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-11 23:06:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2022-07-11 23:06:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:06:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10472 backedges. 0 proven. 1408 refuted. 0 times theorem prover too weak. 9064 trivial. 0 not checked. [2022-07-11 23:06:40,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:06:40,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410005479] [2022-07-11 23:06:40,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410005479] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:06:40,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421420406] [2022-07-11 23:06:40,377 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:06:40,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:06:40,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:06:40,378 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-07-11 23:06:40,395 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-07-11 23:06:40,606 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:06:40,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:06:40,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 280 conjunts are in the unsatisfiable core [2022-07-11 23:06:40,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:06:40,660 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-11 23:06:40,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-07-11 23:06:40,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:06:40,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-07-11 23:06:40,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-11 23:06:40,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-07-11 23:06:40,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-07-11 23:06:41,163 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:41,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:41,500 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:41,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:41,772 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:41,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:42,011 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:42,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:42,243 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:42,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:42,485 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:42,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:42,709 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:42,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:43,039 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:43,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:43,347 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:43,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:43,656 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:43,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:44,004 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:44,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:44,337 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:44,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:44,687 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:44,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:45,006 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:45,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:45,350 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:45,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:45,696 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:45,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:46,038 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:46,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:46,391 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:46,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:46,757 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:46,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:47,144 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-11 23:06:47,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-11 23:06:47,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-07-11 23:06:47,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-07-11 23:06:47,380 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:47,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:47,457 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:47,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:47,533 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:47,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:47,612 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:47,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:47,689 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:47,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:47,772 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:47,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:47,886 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:47,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:47,960 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:47,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:48,058 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:48,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:48,133 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:48,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:48,213 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:48,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:48,283 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:48,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:48,370 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:48,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:48,468 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:48,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:48,554 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:48,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:48,642 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:48,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:48,741 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:48,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:48,814 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:48,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:48,922 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:48,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:49,062 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:06:49,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-11 23:06:49,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 12 [2022-07-11 23:06:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10472 backedges. 2757 proven. 590 refuted. 0 times theorem prover too weak. 7125 trivial. 0 not checked. [2022-07-11 23:06:49,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:06:51,395 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_117| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_117|)) (forall ((v_ArrVal_854 Int)) (< 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#c~0#1.base|) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_117| 4)) v_ArrVal_854) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| 4)))))) is different from false [2022-07-11 23:07:02,185 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_118| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_118|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_117| Int) (v_ArrVal_854 Int) (v_ArrVal_853 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_118| 1) |v_ULTIMATE.start_main_~i~0#1_117|)) (< 0 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#c~0#1.base|) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_118| 4)) v_ArrVal_853) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_117| 4)) v_ArrVal_854) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| 4))))))) is different from false [2022-07-11 23:11:03,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (forall ((v_ArrVal_851 Int) (v_ArrVal_848 Int) (|v_ULTIMATE.start_main_~i~0#1_118| Int) (|v_ULTIMATE.start_main_~i~0#1_117| Int) (v_ArrVal_854 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int) (v_ArrVal_853 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_118| 1) |v_ULTIMATE.start_main_~i~0#1_117|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_120| 1) |v_ULTIMATE.start_main_~i~0#1_119|)) (< 0 (select (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#c~0#1.base|) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_120| 4)) v_ArrVal_848) (+ (* |v_ULTIMATE.start_main_~i~0#1_119| 4) |c_ULTIMATE.start_main_~#c~0#1.offset|) v_ArrVal_851) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_118| 4)) v_ArrVal_853) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_117| 4)) v_ArrVal_854) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| 4))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_119| 1) |v_ULTIMATE.start_main_~i~0#1_118|)))))) is different from false