./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/list-simple/sll2n_append_equal.i -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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 09:06:48,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 09:06:48,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 09:06:48,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 09:06:48,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 09:06:48,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 09:06:48,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 09:06:48,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 09:06:48,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 09:06:48,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 09:06:48,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 09:06:48,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 09:06:48,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 09:06:48,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 09:06:48,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 09:06:48,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 09:06:48,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 09:06:48,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 09:06:48,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 09:06:48,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 09:06:48,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 09:06:48,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 09:06:48,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 09:06:48,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 09:06:48,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 09:06:48,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 09:06:48,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 09:06:48,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 09:06:48,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 09:06:48,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 09:06:48,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 09:06:48,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 09:06:48,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 09:06:48,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 09:06:48,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 09:06:48,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 09:06:48,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 09:06:48,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 09:06:48,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 09:06:48,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 09:06:48,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 09:06:48,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 09:06:48,744 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 09:06:48,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 09:06:48,745 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 09:06:48,745 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 09:06:48,746 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 09:06:48,746 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 09:06:48,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 09:06:48,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 09:06:48,748 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 09:06:48,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 09:06:48,748 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 09:06:48,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 09:06:48,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 09:06:48,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 09:06:48,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 09:06:48,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 09:06:48,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 09:06:48,750 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 09:06:48,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 09:06:48,750 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 09:06:48,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 09:06:48,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 09:06:48,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 09:06:48,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 09:06:48,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:06:48,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 09:06:48,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 09:06:48,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 09:06:48,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 09:06:48,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 09:06:48,752 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 09:06:48,753 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 09:06:48,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 09:06:48,753 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 09:06:48,753 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2021-12-17 09:06:49,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 09:06:49,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 09:06:49,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 09:06:49,043 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 09:06:49,044 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 09:06:49,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2021-12-17 09:06:49,110 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474468a2f/52888de185b542f49227a23f5eafebb4/FLAG8b7cc2962 [2021-12-17 09:06:49,608 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 09:06:49,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2021-12-17 09:06:49,621 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474468a2f/52888de185b542f49227a23f5eafebb4/FLAG8b7cc2962 [2021-12-17 09:06:50,101 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474468a2f/52888de185b542f49227a23f5eafebb4 [2021-12-17 09:06:50,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 09:06:50,104 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 09:06:50,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 09:06:50,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 09:06:50,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 09:06:50,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:06:50" (1/1) ... [2021-12-17 09:06:50,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2c5a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:50, skipping insertion in model container [2021-12-17 09:06:50,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:06:50" (1/1) ... [2021-12-17 09:06:50,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 09:06:50,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 09:06:50,473 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/list-simple/sll2n_append_equal.i[24197,24210] [2021-12-17 09:06:50,477 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:06:50,483 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 09:06:50,537 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/list-simple/sll2n_append_equal.i[24197,24210] [2021-12-17 09:06:50,538 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:06:50,563 INFO L208 MainTranslator]: Completed translation [2021-12-17 09:06:50,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:50 WrapperNode [2021-12-17 09:06:50,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 09:06:50,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 09:06:50,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 09:06:50,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 09:06:50,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:50" (1/1) ... [2021-12-17 09:06:50,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:50" (1/1) ... [2021-12-17 09:06:50,628 INFO L137 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2021-12-17 09:06:50,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 09:06:50,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 09:06:50,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 09:06:50,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 09:06:50,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:50" (1/1) ... [2021-12-17 09:06:50,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:50" (1/1) ... [2021-12-17 09:06:50,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:50" (1/1) ... [2021-12-17 09:06:50,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:50" (1/1) ... [2021-12-17 09:06:50,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:50" (1/1) ... [2021-12-17 09:06:50,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:50" (1/1) ... [2021-12-17 09:06:50,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:50" (1/1) ... [2021-12-17 09:06:50,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 09:06:50,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 09:06:50,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 09:06:50,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 09:06:50,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:50" (1/1) ... [2021-12-17 09:06:50,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:06:50,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:06:50,708 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) [2021-12-17 09:06:50,737 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 [2021-12-17 09:06:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 09:06:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 09:06:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-17 09:06:50,751 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-17 09:06:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 09:06:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 09:06:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 09:06:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 09:06:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 09:06:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 09:06:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 09:06:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 09:06:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 09:06:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 09:06:50,893 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 09:06:50,895 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 09:06:51,038 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 09:06:51,043 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 09:06:51,043 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-17 09:06:51,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:06:51 BoogieIcfgContainer [2021-12-17 09:06:51,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 09:06:51,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 09:06:51,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 09:06:51,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 09:06:51,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:06:50" (1/3) ... [2021-12-17 09:06:51,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482807b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:06:51, skipping insertion in model container [2021-12-17 09:06:51,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:06:50" (2/3) ... [2021-12-17 09:06:51,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482807b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:06:51, skipping insertion in model container [2021-12-17 09:06:51,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:06:51" (3/3) ... [2021-12-17 09:06:51,052 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2021-12-17 09:06:51,056 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 09:06:51,056 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 09:06:51,104 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 09:06:51,114 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 09:06:51,115 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 09:06:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:06:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 09:06:51,145 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:06:51,145 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:06:51,146 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:06:51,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:06:51,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2128592868, now seen corresponding path program 1 times [2021-12-17 09:06:51,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:06:51,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777559520] [2021-12-17 09:06:51,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:06:51,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:06:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:51,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 09:06:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:06:51,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:06:51,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777559520] [2021-12-17 09:06:51,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777559520] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:06:51,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:06:51,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 09:06:51,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608099936] [2021-12-17 09:06:51,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:06:51,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 09:06:51,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:06:51,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 09:06:51,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 09:06:51,441 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 09:06:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:06:51,504 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2021-12-17 09:06:51,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 09:06:51,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-17 09:06:51,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:06:51,512 INFO L225 Difference]: With dead ends: 56 [2021-12-17 09:06:51,512 INFO L226 Difference]: Without dead ends: 25 [2021-12-17 09:06:51,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 09:06:51,518 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:06:51,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:06:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-17 09:06:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-17 09:06:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:06:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2021-12-17 09:06:51,548 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2021-12-17 09:06:51,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:06:51,548 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-12-17 09:06:51,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 09:06:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2021-12-17 09:06:51,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 09:06:51,551 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:06:51,551 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:06:51,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 09:06:51,552 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:06:51,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:06:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1341887012, now seen corresponding path program 1 times [2021-12-17 09:06:51,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:06:51,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92327414] [2021-12-17 09:06:51,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:06:51,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:06:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:51,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 09:06:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:06:51,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:06:51,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92327414] [2021-12-17 09:06:51,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92327414] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:06:51,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:06:51,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 09:06:51,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545197836] [2021-12-17 09:06:51,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:06:51,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 09:06:51,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:06:51,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 09:06:51,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 09:06:51,641 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 09:06:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:06:51,685 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2021-12-17 09:06:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 09:06:51,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-17 09:06:51,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:06:51,687 INFO L225 Difference]: With dead ends: 48 [2021-12-17 09:06:51,687 INFO L226 Difference]: Without dead ends: 29 [2021-12-17 09:06:51,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 09:06:51,689 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:06:51,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 66 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:06:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-17 09:06:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2021-12-17 09:06:51,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:06:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2021-12-17 09:06:51,696 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2021-12-17 09:06:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:06:51,697 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2021-12-17 09:06:51,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 09:06:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2021-12-17 09:06:51,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 09:06:51,698 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:06:51,698 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:06:51,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 09:06:51,699 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:06:51,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:06:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2097266908, now seen corresponding path program 1 times [2021-12-17 09:06:51,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:06:51,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555203423] [2021-12-17 09:06:51,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:06:51,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:06:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:06:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:51,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 09:06:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:06:51,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:06:51,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555203423] [2021-12-17 09:06:51,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555203423] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:06:51,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390381714] [2021-12-17 09:06:51,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:06:51,836 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:06:51,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:06:51,838 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) [2021-12-17 09:06:51,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 09:06:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:51,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 09:06:51,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:06:52,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:06:52,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:06:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:06:52,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390381714] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:06:52,103 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:06:52,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2021-12-17 09:06:52,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71354462] [2021-12-17 09:06:52,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:06:52,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 09:06:52,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:06:52,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 09:06:52,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 09:06:52,105 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-17 09:06:52,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:06:52,145 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2021-12-17 09:06:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 09:06:52,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2021-12-17 09:06:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:06:52,147 INFO L225 Difference]: With dead ends: 49 [2021-12-17 09:06:52,147 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 09:06:52,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 09:06:52,149 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:06:52,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 88 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:06:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 09:06:52,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-17 09:06:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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) [2021-12-17 09:06:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-12-17 09:06:52,155 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 26 [2021-12-17 09:06:52,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:06:52,155 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-12-17 09:06:52,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-17 09:06:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-12-17 09:06:52,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 09:06:52,157 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:06:52,157 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:06:52,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-17 09:06:52,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:06:52,376 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:06:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:06:52,377 INFO L85 PathProgramCache]: Analyzing trace with hash -867054116, now seen corresponding path program 2 times [2021-12-17 09:06:52,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:06:52,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880127935] [2021-12-17 09:06:52,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:06:52,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:06:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:52,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:06:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:52,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:06:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:52,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:06:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-17 09:06:52,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:06:52,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880127935] [2021-12-17 09:06:52,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880127935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:06:52,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:06:52,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 09:06:52,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485539853] [2021-12-17 09:06:52,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:06:52,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 09:06:52,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:06:52,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 09:06:52,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-17 09:06:52,663 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:06:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:06:52,782 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2021-12-17 09:06:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 09:06:52,797 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2021-12-17 09:06:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:06:52,798 INFO L225 Difference]: With dead ends: 43 [2021-12-17 09:06:52,798 INFO L226 Difference]: Without dead ends: 40 [2021-12-17 09:06:52,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-12-17 09:06:52,800 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:06:52,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 135 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:06:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-17 09:06:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2021-12-17 09:06:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) [2021-12-17 09:06:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2021-12-17 09:06:52,806 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 35 [2021-12-17 09:06:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:06:52,807 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-17 09:06:52,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:06:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-12-17 09:06:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 09:06:52,808 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:06:52,808 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:06:52,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 09:06:52,809 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:06:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:06:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash -867052442, now seen corresponding path program 1 times [2021-12-17 09:06:52,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:06:52,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517577939] [2021-12-17 09:06:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:06:52,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:06:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:53,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:06:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:53,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:06:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:53,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:06:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:06:53,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:06:53,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517577939] [2021-12-17 09:06:53,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517577939] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:06:53,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540386369] [2021-12-17 09:06:53,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:06:53,145 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:06:53,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:06:53,148 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) [2021-12-17 09:06:53,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 09:06:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:53,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-17 09:06:53,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:06:53,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-17 09:06:53,672 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_405 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_405))) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2021-12-17 09:06:53,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:06:53,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-12-17 09:06:53,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-17 09:06:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-12-17 09:06:53,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:06:53,867 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array Int Int)) (|v_node_create_~temp~0#1.base_13| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_13| v_ArrVal_408) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (<= |c_#StackHeapBarrier| |v_node_create_~temp~0#1.base_13|) (<= 1 .cse0) (<= (+ .cse0 1) 0)))) is different from false [2021-12-17 09:06:53,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540386369] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:06:53,869 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:06:53,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2021-12-17 09:06:53,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070442845] [2021-12-17 09:06:53,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:06:53,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-17 09:06:53,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:06:53,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-17 09:06:53,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=439, Unknown=2, NotChecked=86, Total=600 [2021-12-17 09:06:53,872 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 09:06:54,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:06:54,139 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2021-12-17 09:06:54,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 09:06:54,144 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2021-12-17 09:06:54,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:06:54,145 INFO L225 Difference]: With dead ends: 37 [2021-12-17 09:06:54,145 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 09:06:54,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=698, Unknown=2, NotChecked=110, Total=930 [2021-12-17 09:06:54,146 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:06:54,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 183 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 180 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2021-12-17 09:06:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 09:06:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-17 09:06:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 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) [2021-12-17 09:06:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-12-17 09:06:54,152 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 35 [2021-12-17 09:06:54,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:06:54,153 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-17 09:06:54,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 09:06:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-12-17 09:06:54,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 09:06:54,154 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:06:54,154 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:06:54,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 09:06:54,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:06:54,373 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:06:54,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:06:54,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1386356248, now seen corresponding path program 1 times [2021-12-17 09:06:54,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:06:54,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954477898] [2021-12-17 09:06:54,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:06:54,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:06:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:54,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:06:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:54,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:06:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:54,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:06:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:06:54,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:06:54,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954477898] [2021-12-17 09:06:54,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954477898] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:06:54,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245788170] [2021-12-17 09:06:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:06:54,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:06:54,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:06:54,753 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) [2021-12-17 09:06:54,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 09:06:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:06:54,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-17 09:06:54,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:06:55,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-17 09:06:55,151 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_557 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_557))))) is different from true [2021-12-17 09:06:55,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:06:55,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-17 09:06:55,278 INFO L354 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2021-12-17 09:06:55,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 35 [2021-12-17 09:06:55,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-17 09:06:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-12-17 09:06:55,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:06:59,536 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|v_node_create_~temp~0#1.base_16| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_558 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_16| v_ArrVal_562))) (let ((.cse0 (select .cse2 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (or (<= |c_#StackHeapBarrier| |v_node_create_~temp~0#1.base_16|) (not (= 0 (select .cse0 .cse1))) (not (= 0 (select (select (store .cse2 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_558)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2021-12-17 09:06:59,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245788170] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:06:59,538 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:06:59,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2021-12-17 09:06:59,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292896486] [2021-12-17 09:06:59,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:06:59,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-17 09:06:59,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:06:59,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-17 09:06:59,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=781, Unknown=4, NotChecked=114, Total=992 [2021-12-17 09:06:59,540 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 28 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 23 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-17 09:07:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:07:00,097 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2021-12-17 09:07:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 09:07:00,098 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 23 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2021-12-17 09:07:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:07:00,098 INFO L225 Difference]: With dead ends: 50 [2021-12-17 09:07:00,099 INFO L226 Difference]: Without dead ends: 47 [2021-12-17 09:07:00,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=222, Invalid=1762, Unknown=4, NotChecked=174, Total=2162 [2021-12-17 09:07:00,100 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 68 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:07:00,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 209 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 283 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2021-12-17 09:07:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-17 09:07:00,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2021-12-17 09:07:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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) [2021-12-17 09:07:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2021-12-17 09:07:00,106 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 38 [2021-12-17 09:07:00,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:07:00,106 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2021-12-17 09:07:00,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 23 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-17 09:07:00,106 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2021-12-17 09:07:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 09:07:00,107 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:07:00,107 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:07:00,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-17 09:07:00,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:00,324 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:07:00,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:07:00,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1386357922, now seen corresponding path program 1 times [2021-12-17 09:07:00,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:07:00,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961125970] [2021-12-17 09:07:00,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:00,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:07:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:00,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:07:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:00,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:07:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:00,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:07:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:07:00,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:07:00,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961125970] [2021-12-17 09:07:00,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961125970] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:00,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750668155] [2021-12-17 09:07:00,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:00,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:00,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:07:00,860 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) [2021-12-17 09:07:00,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 09:07:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:01,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 76 conjunts are in the unsatisfiable core [2021-12-17 09:07:01,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:07:01,202 INFO L388 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 6 treesize of output 5 [2021-12-17 09:07:01,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:07:01,509 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:07:01,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 13 [2021-12-17 09:07:01,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:07:01,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:01,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 09:07:01,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:01,723 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:07:01,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2021-12-17 09:07:01,732 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 09:07:01,732 INFO L388 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 15 treesize of output 15 [2021-12-17 09:07:01,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:07:01,841 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:07:01,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2021-12-17 09:07:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:07:01,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:07:02,015 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (|v_node_create_~temp~0#1.base_19| Int) (v_ArrVal_720 (Array Int Int))) (or (not (= 0 (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_720))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_19| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)))) (not (= 0 (select |c_#valid| |v_node_create_~temp~0#1.base_19|))) (<= |c_#StackHeapBarrier| |v_node_create_~temp~0#1.base_19|))) is different from false [2021-12-17 09:07:02,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750668155] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:02,016 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:07:02,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2021-12-17 09:07:02,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78197814] [2021-12-17 09:07:02,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:07:02,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-17 09:07:02,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:07:02,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-17 09:07:02,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1170, Unknown=3, NotChecked=68, Total=1332 [2021-12-17 09:07:02,018 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 34 states, 32 states have (on average 1.90625) internal successors, (61), 29 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-17 09:07:02,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:07:02,941 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2021-12-17 09:07:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 09:07:02,942 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.90625) internal successors, (61), 29 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2021-12-17 09:07:02,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:07:02,943 INFO L225 Difference]: With dead ends: 42 [2021-12-17 09:07:02,943 INFO L226 Difference]: Without dead ends: 34 [2021-12-17 09:07:02,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=206, Invalid=2050, Unknown=4, NotChecked=92, Total=2352 [2021-12-17 09:07:02,946 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:07:02,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 388 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 447 Invalid, 0 Unknown, 38 Unchecked, 0.2s Time] [2021-12-17 09:07:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-17 09:07:02,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-17 09:07:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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) [2021-12-17 09:07:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2021-12-17 09:07:02,951 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 38 [2021-12-17 09:07:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:07:02,951 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2021-12-17 09:07:02,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.90625) internal successors, (61), 29 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-17 09:07:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2021-12-17 09:07:02,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 09:07:02,952 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:07:02,952 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:07:02,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 09:07:03,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:03,176 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:07:03,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:07:03,176 INFO L85 PathProgramCache]: Analyzing trace with hash 403581565, now seen corresponding path program 1 times [2021-12-17 09:07:03,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:07:03,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557793983] [2021-12-17 09:07:03,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:03,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:07:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:03,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:07:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:03,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:07:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:03,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:07:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:07:04,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:07:04,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557793983] [2021-12-17 09:07:04,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557793983] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:04,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644137315] [2021-12-17 09:07:04,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:04,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:04,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:07:04,059 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:07:04,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 09:07:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:04,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 113 conjunts are in the unsatisfiable core [2021-12-17 09:07:04,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:07:04,338 INFO L388 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 6 treesize of output 5 [2021-12-17 09:07:04,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-17 09:07:04,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:07:04,711 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 09:07:04,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-17 09:07:04,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:07:04,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:04,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 09:07:05,123 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:07:05,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 28 [2021-12-17 09:07:05,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:07:05,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:07:05,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:05,389 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:07:05,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2021-12-17 09:07:05,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:05,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 09:07:05,417 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:07:05,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-17 09:07:05,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:05,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 09:07:05,822 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-17 09:07:05,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 84 [2021-12-17 09:07:05,834 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 09:07:05,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2021-12-17 09:07:05,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:05,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-17 09:07:05,923 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:07:05,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2021-12-17 09:07:05,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:07:05,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:07:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:07:06,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:07:06,041 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_882) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_884) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-17 09:07:06,059 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_882) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_883) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_884) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-17 09:07:06,073 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_882) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_883) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_884) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-17 09:07:06,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644137315] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:06,254 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:07:06,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2021-12-17 09:07:06,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462302444] [2021-12-17 09:07:06,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:07:06,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-17 09:07:06,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:07:06,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-17 09:07:06,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1853, Unknown=4, NotChecked=264, Total=2256 [2021-12-17 09:07:06,256 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 44 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:07:07,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:07:07,562 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2021-12-17 09:07:07,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 09:07:07,563 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2021-12-17 09:07:07,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:07:07,572 INFO L225 Difference]: With dead ends: 47 [2021-12-17 09:07:07,573 INFO L226 Difference]: Without dead ends: 45 [2021-12-17 09:07:07,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=291, Invalid=3256, Unknown=5, NotChecked=354, Total=3906 [2021-12-17 09:07:07,574 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 83 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:07:07,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 312 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 603 Invalid, 0 Unknown, 27 Unchecked, 0.3s Time] [2021-12-17 09:07:07,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-17 09:07:07,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2021-12-17 09:07:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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) [2021-12-17 09:07:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2021-12-17 09:07:07,581 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 40 [2021-12-17 09:07:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:07:07,581 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2021-12-17 09:07:07,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:07:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2021-12-17 09:07:07,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 09:07:07,583 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:07:07,583 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:07:07,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 09:07:07,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:07,804 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:07:07,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:07:07,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1294860110, now seen corresponding path program 1 times [2021-12-17 09:07:07,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:07:07,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172161887] [2021-12-17 09:07:07,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:07,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:07:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:08,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:07:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:08,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:07:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:08,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:07:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:07:08,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:07:08,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172161887] [2021-12-17 09:07:08,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172161887] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:08,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072985374] [2021-12-17 09:07:08,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:08,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:08,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:07:08,708 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:07:08,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 09:07:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:08,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 77 conjunts are in the unsatisfiable core [2021-12-17 09:07:08,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:07:08,869 INFO L388 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 6 treesize of output 5 [2021-12-17 09:07:08,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-17 09:07:09,008 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 09:07:09,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-17 09:07:09,111 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:07:09,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:07:09,228 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-12-17 09:07:09,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-12-17 09:07:09,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:07:09,554 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-12-17 09:07:09,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 30 [2021-12-17 09:07:09,563 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:07:09,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2021-12-17 09:07:09,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:09,736 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:07:09,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 79 [2021-12-17 09:07:09,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:09,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2021-12-17 09:07:09,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:09,762 INFO L354 Elim1Store]: treesize reduction 30, result has 47.4 percent of original size [2021-12-17 09:07:09,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 39 [2021-12-17 09:07:10,010 INFO L354 Elim1Store]: treesize reduction 102, result has 30.6 percent of original size [2021-12-17 09:07:10,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 76 [2021-12-17 09:07:10,025 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-17 09:07:10,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2021-12-17 09:07:10,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2021-12-17 09:07:10,116 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-17 09:07:10,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 23 [2021-12-17 09:07:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 09:07:10,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:07:21,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072985374] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:21,044 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:07:21,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 45 [2021-12-17 09:07:21,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060532739] [2021-12-17 09:07:21,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:07:21,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-17 09:07:21,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:07:21,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-17 09:07:21,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2289, Unknown=6, NotChecked=0, Total=2450 [2021-12-17 09:07:21,046 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 45 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 37 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:07:22,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:07:22,559 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2021-12-17 09:07:22,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 09:07:22,568 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 37 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2021-12-17 09:07:22,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:07:22,569 INFO L225 Difference]: With dead ends: 47 [2021-12-17 09:07:22,569 INFO L226 Difference]: Without dead ends: 44 [2021-12-17 09:07:22,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=396, Invalid=4567, Unknown=7, NotChecked=0, Total=4970 [2021-12-17 09:07:22,571 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:07:22,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 457 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 549 Invalid, 0 Unknown, 49 Unchecked, 0.3s Time] [2021-12-17 09:07:22,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-17 09:07:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2021-12-17 09:07:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 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) [2021-12-17 09:07:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2021-12-17 09:07:22,578 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 42 [2021-12-17 09:07:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:07:22,578 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2021-12-17 09:07:22,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 37 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:07:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2021-12-17 09:07:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 09:07:22,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:07:22,580 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:07:22,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 09:07:22,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:22,784 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:07:22,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:07:22,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1294861784, now seen corresponding path program 1 times [2021-12-17 09:07:22,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:07:22,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460894797] [2021-12-17 09:07:22,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:22,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:07:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:23,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:07:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:23,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:07:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:23,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:07:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:07:23,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:07:23,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460894797] [2021-12-17 09:07:23,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460894797] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:23,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282199046] [2021-12-17 09:07:23,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:23,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:23,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:07:23,887 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:07:23,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 09:07:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:24,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 153 conjunts are in the unsatisfiable core [2021-12-17 09:07:24,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:07:24,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:07:24,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:07:24,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:24,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 09:07:24,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:07:24,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-17 09:07:24,682 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 09:07:24,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-17 09:07:24,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 09:07:24,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:07:24,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:07:24,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-17 09:07:25,170 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:07:25,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 46 [2021-12-17 09:07:25,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:25,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-17 09:07:25,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2021-12-17 09:07:25,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:07:25,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:25,464 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:07:25,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 87 [2021-12-17 09:07:25,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:25,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-17 09:07:25,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:25,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:25,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:25,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 09:07:25,499 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:07:25,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-17 09:07:26,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:26,199 INFO L354 Elim1Store]: treesize reduction 124, result has 15.1 percent of original size [2021-12-17 09:07:26,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 45 [2021-12-17 09:07:26,234 INFO L354 Elim1Store]: treesize reduction 75, result has 24.2 percent of original size [2021-12-17 09:07:26,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 118 treesize of output 82 [2021-12-17 09:07:26,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:26,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2021-12-17 09:07:26,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:07:26,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:26,436 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:07:26,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 70 [2021-12-17 09:07:26,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:26,446 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-17 09:07:26,447 INFO L388 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 25 [2021-12-17 09:07:26,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 10 [2021-12-17 09:07:26,643 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:07:26,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:08:10,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282199046] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:10,520 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:08:10,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 53 [2021-12-17 09:08:10,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426164029] [2021-12-17 09:08:10,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:08:10,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-12-17 09:08:10,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:08:10,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-12-17 09:08:10,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=3560, Unknown=13, NotChecked=0, Total=3782 [2021-12-17 09:08:10,524 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 45 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:08:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:12,146 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2021-12-17 09:08:12,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-17 09:08:12,147 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 45 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2021-12-17 09:08:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:12,147 INFO L225 Difference]: With dead ends: 66 [2021-12-17 09:08:12,147 INFO L226 Difference]: Without dead ends: 64 [2021-12-17 09:08:12,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 46.7s TimeCoverageRelationStatistics Valid=364, Invalid=5024, Unknown=14, NotChecked=0, Total=5402 [2021-12-17 09:08:12,149 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:08:12,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 366 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 634 Invalid, 0 Unknown, 127 Unchecked, 0.4s Time] [2021-12-17 09:08:12,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-17 09:08:12,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2021-12-17 09:08:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-17 09:08:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2021-12-17 09:08:12,158 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 42 [2021-12-17 09:08:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:12,159 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2021-12-17 09:08:12,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 45 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:08:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2021-12-17 09:08:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 09:08:12,160 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:12,160 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:08:12,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 09:08:12,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:08:12,376 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:12,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:12,376 INFO L85 PathProgramCache]: Analyzing trace with hash 848307608, now seen corresponding path program 2 times [2021-12-17 09:08:12,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:08:12,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913381228] [2021-12-17 09:08:12,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:12,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:08:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:13,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:08:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:13,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:08:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:13,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:08:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:08:13,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:08:13,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913381228] [2021-12-17 09:08:13,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913381228] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:13,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495941866] [2021-12-17 09:08:13,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:08:13,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:08:13,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:08:13,586 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:08:13,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 09:08:13,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:08:13,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:08:13,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 149 conjunts are in the unsatisfiable core [2021-12-17 09:08:13,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:13,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:08:13,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:08:14,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:08:14,815 INFO L354 Elim1Store]: treesize reduction 59, result has 24.4 percent of original size [2021-12-17 09:08:14,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 37 [2021-12-17 09:08:14,844 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 09:08:14,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-17 09:08:14,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:08:14,947 INFO L388 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 30 treesize of output 25 [2021-12-17 09:08:14,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:08:14,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:14,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 09:08:15,407 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-17 09:08:15,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 60 [2021-12-17 09:08:15,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:15,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 15 [2021-12-17 09:08:15,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:08:15,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2021-12-17 09:08:15,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:15,654 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-17 09:08:15,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 110 treesize of output 94 [2021-12-17 09:08:15,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:15,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 09:08:15,677 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:08:15,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-17 09:08:15,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:15,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:15,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-12-17 09:08:16,520 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:08:16,608 INFO L354 Elim1Store]: treesize reduction 326, result has 13.1 percent of original size [2021-12-17 09:08:16,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 20 case distinctions, treesize of input 327 treesize of output 143 [2021-12-17 09:08:16,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:16,634 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-12-17 09:08:16,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 123 [2021-12-17 09:08:16,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2021-12-17 09:08:16,820 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-17 09:08:16,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 75 [2021-12-17 09:08:16,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:16,828 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-17 09:08:16,828 INFO L388 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 1 case distinctions, treesize of input 39 treesize of output 21 [2021-12-17 09:08:16,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:08:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:08:16,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:08:16,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1408 Int) (v_ArrVal_1412 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1412) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_1408)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-17 09:08:17,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495941866] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:17,967 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:08:17,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 51 [2021-12-17 09:08:17,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760865945] [2021-12-17 09:08:17,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:08:17,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-17 09:08:17,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:08:17,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-17 09:08:17,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=3115, Unknown=7, NotChecked=112, Total=3422 [2021-12-17 09:08:17,969 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 42 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:08:20,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:20,988 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2021-12-17 09:08:20,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-17 09:08:20,995 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 42 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2021-12-17 09:08:20,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:20,995 INFO L225 Difference]: With dead ends: 78 [2021-12-17 09:08:20,996 INFO L226 Difference]: Without dead ends: 76 [2021-12-17 09:08:20,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=409, Invalid=5750, Unknown=7, NotChecked=154, Total=6320 [2021-12-17 09:08:20,998 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 64 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 09:08:20,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 412 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 970 Invalid, 0 Unknown, 133 Unchecked, 0.6s Time] [2021-12-17 09:08:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-17 09:08:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 60. [2021-12-17 09:08:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-17 09:08:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2021-12-17 09:08:21,007 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 42 [2021-12-17 09:08:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:21,008 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2021-12-17 09:08:21,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 42 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:08:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2021-12-17 09:08:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 09:08:21,009 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:21,009 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:08:21,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 09:08:21,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-17 09:08:21,220 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:21,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:21,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1178308631, now seen corresponding path program 2 times [2021-12-17 09:08:21,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:08:21,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522353408] [2021-12-17 09:08:21,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:21,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:08:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:21,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:08:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:21,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:08:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:21,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:08:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:08:22,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:08:22,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522353408] [2021-12-17 09:08:22,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522353408] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:22,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964802607] [2021-12-17 09:08:22,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:08:22,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:08:22,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:08:22,026 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:08:22,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 09:08:22,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:08:22,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:08:22,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 127 conjunts are in the unsatisfiable core [2021-12-17 09:08:22,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:22,244 INFO L388 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 6 treesize of output 5 [2021-12-17 09:08:22,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-17 09:08:22,402 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 09:08:22,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-17 09:08:22,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:08:22,627 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-17 09:08:22,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-17 09:08:22,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:08:22,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:08:22,970 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:08:22,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 30 [2021-12-17 09:08:22,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:08:22,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-12-17 09:08:23,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:23,155 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:08:23,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 61 [2021-12-17 09:08:23,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:23,171 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:08:23,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2021-12-17 09:08:23,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:23,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 09:08:23,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:08:23,772 INFO L354 Elim1Store]: treesize reduction 135, result has 17.2 percent of original size [2021-12-17 09:08:23,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 212 treesize of output 106 [2021-12-17 09:08:23,790 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-12-17 09:08:23,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 228 treesize of output 145 [2021-12-17 09:08:23,977 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-17 09:08:23,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 113 [2021-12-17 09:08:29,644 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-12-17 09:08:29,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 43 [2021-12-17 09:08:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:08:29,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:08:41,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964802607] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:41,111 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:08:41,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 51 [2021-12-17 09:08:41,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204054996] [2021-12-17 09:08:41,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:08:41,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-17 09:08:41,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:08:41,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-17 09:08:41,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=3580, Unknown=14, NotChecked=0, Total=3782 [2021-12-17 09:08:41,113 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 51 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 42 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:08:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:45,190 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2021-12-17 09:08:45,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 09:08:45,191 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 42 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2021-12-17 09:08:45,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:45,191 INFO L225 Difference]: With dead ends: 74 [2021-12-17 09:08:45,191 INFO L226 Difference]: Without dead ends: 71 [2021-12-17 09:08:45,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=390, Invalid=6238, Unknown=14, NotChecked=0, Total=6642 [2021-12-17 09:08:45,193 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:08:45,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 530 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 686 Invalid, 0 Unknown, 50 Unchecked, 0.3s Time] [2021-12-17 09:08:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-17 09:08:45,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2021-12-17 09:08:45,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 57 states have internal predecessors, (66), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-17 09:08:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2021-12-17 09:08:45,203 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 44 [2021-12-17 09:08:45,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:45,203 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2021-12-17 09:08:45,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 42 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:08:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2021-12-17 09:08:45,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 09:08:45,205 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:45,205 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:08:45,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 09:08:45,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:08:45,429 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:45,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:45,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1178306957, now seen corresponding path program 2 times [2021-12-17 09:08:45,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:08:45,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867037949] [2021-12-17 09:08:45,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:45,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:08:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:08:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:46,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:08:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:46,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:08:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:08:46,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:08:46,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867037949] [2021-12-17 09:08:46,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867037949] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:46,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516252337] [2021-12-17 09:08:46,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:08:46,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:08:46,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:08:46,378 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 09:08:46,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 09:08:46,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:08:46,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:08:46,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 151 conjunts are in the unsatisfiable core [2021-12-17 09:08:46,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:46,599 INFO L388 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 6 treesize of output 5 [2021-12-17 09:08:46,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-17 09:08:46,901 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: line 643455 column 46: unknown constant v_#valid_BEFORE_CALL_28 [2021-12-17 09:08:46,902 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 09:08:46,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2021-12-17 09:08:46,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742768572] [2021-12-17 09:08:46,902 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 09:08:46,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-17 09:08:46,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:08:46,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-17 09:08:46,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1050, Unknown=0, NotChecked=0, Total=1122 [2021-12-17 09:08:46,904 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 24 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 09:08:46,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 09:08:46,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=1050, Unknown=0, NotChecked=0, Total=1122 [2021-12-17 09:08:46,905 INFO L933 BasicCegarLoop]: 1 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, 1 SdHoareTripleChecker+Invalid, 1 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 [2021-12-17 09:08:46,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:08:46,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 09:08:47,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-17 09:08:47,128 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@5eb4f46e at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-17 09:08:47,132 INFO L158 Benchmark]: Toolchain (without parser) took 117027.85ms. Allocated memory was 86.0MB in the beginning and 176.2MB in the end (delta: 90.2MB). Free memory was 51.0MB in the beginning and 83.1MB in the end (delta: -32.1MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2021-12-17 09:08:47,132 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory was 59.3MB in the beginning and 59.3MB in the end (delta: 27.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 09:08:47,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.04ms. Allocated memory was 86.0MB in the beginning and 121.6MB in the end (delta: 35.7MB). Free memory was 50.7MB in the beginning and 89.5MB in the end (delta: -38.8MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2021-12-17 09:08:47,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.97ms. Allocated memory is still 121.6MB. Free memory was 89.5MB in the beginning and 87.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:08:47,133 INFO L158 Benchmark]: Boogie Preprocessor took 46.20ms. Allocated memory is still 121.6MB. Free memory was 87.3MB in the beginning and 85.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:08:47,133 INFO L158 Benchmark]: RCFGBuilder took 368.80ms. Allocated memory is still 121.6MB. Free memory was 85.6MB in the beginning and 72.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-17 09:08:47,133 INFO L158 Benchmark]: TraceAbstraction took 116085.37ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 71.8MB in the beginning and 83.1MB in the end (delta: -11.3MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2021-12-17 09:08:47,137 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory was 59.3MB in the beginning and 59.3MB in the end (delta: 27.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.04ms. Allocated memory was 86.0MB in the beginning and 121.6MB in the end (delta: 35.7MB). Free memory was 50.7MB in the beginning and 89.5MB in the end (delta: -38.8MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.97ms. Allocated memory is still 121.6MB. Free memory was 89.5MB in the beginning and 87.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.20ms. Allocated memory is still 121.6MB. Free memory was 87.3MB in the beginning and 85.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 368.80ms. Allocated memory is still 121.6MB. Free memory was 85.6MB in the beginning and 72.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 116085.37ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 71.8MB in the beginning and 83.1MB in the end (delta: -11.3MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@5eb4f46e de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@5eb4f46e: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-17 09:08:47,343 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-12-17 09:08:47,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/list-simple/sll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 09:08:49,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 09:08:49,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 09:08:49,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 09:08:49,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 09:08:49,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 09:08:49,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 09:08:49,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 09:08:49,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 09:08:49,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 09:08:49,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 09:08:49,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 09:08:49,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 09:08:49,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 09:08:49,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 09:08:49,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 09:08:49,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 09:08:49,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 09:08:49,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 09:08:49,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 09:08:49,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 09:08:49,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 09:08:49,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 09:08:49,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 09:08:49,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 09:08:49,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 09:08:49,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 09:08:49,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 09:08:49,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 09:08:49,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 09:08:49,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 09:08:49,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 09:08:49,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 09:08:49,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 09:08:49,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 09:08:49,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 09:08:49,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 09:08:49,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 09:08:49,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 09:08:49,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 09:08:49,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 09:08:49,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 09:08:49,111 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 09:08:49,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 09:08:49,112 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 09:08:49,112 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 09:08:49,113 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 09:08:49,113 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 09:08:49,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 09:08:49,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 09:08:49,114 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 09:08:49,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 09:08:49,114 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 09:08:49,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 09:08:49,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 09:08:49,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 09:08:49,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 09:08:49,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 09:08:49,115 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 09:08:49,115 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 09:08:49,116 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 09:08:49,116 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 09:08:49,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 09:08:49,116 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 09:08:49,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 09:08:49,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 09:08:49,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 09:08:49,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 09:08:49,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:08:49,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 09:08:49,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 09:08:49,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 09:08:49,127 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 09:08:49,127 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 09:08:49,128 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 09:08:49,128 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 09:08:49,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 09:08:49,128 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 09:08:49,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 09:08:49,129 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2021-12-17 09:08:49,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 09:08:49,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 09:08:49,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 09:08:49,425 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 09:08:49,427 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 09:08:49,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2021-12-17 09:08:49,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af5d3f0d/5a633022036649b8b228f5f7742a5fe2/FLAGcd0e9448a [2021-12-17 09:08:49,961 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 09:08:49,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2021-12-17 09:08:49,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af5d3f0d/5a633022036649b8b228f5f7742a5fe2/FLAGcd0e9448a [2021-12-17 09:08:50,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af5d3f0d/5a633022036649b8b228f5f7742a5fe2 [2021-12-17 09:08:50,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 09:08:50,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 09:08:50,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 09:08:50,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 09:08:50,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 09:08:50,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:08:50" (1/1) ... [2021-12-17 09:08:50,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39cca169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:50, skipping insertion in model container [2021-12-17 09:08:50,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:08:50" (1/1) ... [2021-12-17 09:08:50,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 09:08:50,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 09:08:50,643 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/list-simple/sll2n_append_equal.i[24197,24210] [2021-12-17 09:08:50,647 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:08:50,664 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 09:08:50,724 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/list-simple/sll2n_append_equal.i[24197,24210] [2021-12-17 09:08:50,726 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:08:50,760 INFO L208 MainTranslator]: Completed translation [2021-12-17 09:08:50,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:50 WrapperNode [2021-12-17 09:08:50,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 09:08:50,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 09:08:50,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 09:08:50,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 09:08:50,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:50" (1/1) ... [2021-12-17 09:08:50,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:50" (1/1) ... [2021-12-17 09:08:50,829 INFO L137 Inliner]: procedures = 130, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2021-12-17 09:08:50,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 09:08:50,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 09:08:50,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 09:08:50,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 09:08:50,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:50" (1/1) ... [2021-12-17 09:08:50,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:50" (1/1) ... [2021-12-17 09:08:50,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:50" (1/1) ... [2021-12-17 09:08:50,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:50" (1/1) ... [2021-12-17 09:08:50,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:50" (1/1) ... [2021-12-17 09:08:50,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:50" (1/1) ... [2021-12-17 09:08:50,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:50" (1/1) ... [2021-12-17 09:08:50,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 09:08:50,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 09:08:50,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 09:08:50,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 09:08:50,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:50" (1/1) ... [2021-12-17 09:08:50,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:08:50,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:08:50,920 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) [2021-12-17 09:08:50,951 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 [2021-12-17 09:08:50,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-17 09:08:50,972 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-17 09:08:50,973 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-17 09:08:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 09:08:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 09:08:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 09:08:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 09:08:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 09:08:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 09:08:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-17 09:08:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 09:08:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 09:08:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 09:08:50,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 09:08:51,139 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 09:08:51,140 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 09:08:51,382 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 09:08:51,387 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 09:08:51,388 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-17 09:08:51,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:08:51 BoogieIcfgContainer [2021-12-17 09:08:51,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 09:08:51,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 09:08:51,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 09:08:51,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 09:08:51,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:08:50" (1/3) ... [2021-12-17 09:08:51,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cd9f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:08:51, skipping insertion in model container [2021-12-17 09:08:51,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:50" (2/3) ... [2021-12-17 09:08:51,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cd9f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:08:51, skipping insertion in model container [2021-12-17 09:08:51,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:08:51" (3/3) ... [2021-12-17 09:08:51,398 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2021-12-17 09:08:51,402 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 09:08:51,402 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 09:08:51,443 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 09:08:51,455 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 09:08:51,455 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 09:08:51,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:08:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 09:08:51,484 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:51,485 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:08:51,485 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:51,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2128592868, now seen corresponding path program 1 times [2021-12-17 09:08:51,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:08:51,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719859199] [2021-12-17 09:08:51,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:51,506 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:08:51,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:08:51,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:08:51,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 09:08:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:51,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 09:08:51,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:08:51,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 09:08:51,720 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:08:51,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719859199] [2021-12-17 09:08:51,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719859199] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:08:51,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:08:51,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 09:08:51,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086290433] [2021-12-17 09:08:51,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:08:51,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 09:08:51,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:08:51,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 09:08:51,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 09:08:51,758 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 09:08:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:51,785 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2021-12-17 09:08:51,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 09:08:51,787 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-17 09:08:51,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:51,792 INFO L225 Difference]: With dead ends: 56 [2021-12-17 09:08:51,792 INFO L226 Difference]: Without dead ends: 25 [2021-12-17 09:08:51,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 09:08:51,799 INFO L933 BasicCegarLoop]: 38 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, 38 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 [2021-12-17 09:08:51,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:08:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-17 09:08:51,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-17 09:08:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:08:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2021-12-17 09:08:51,835 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2021-12-17 09:08:51,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:51,835 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-12-17 09:08:51,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 09:08:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2021-12-17 09:08:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 09:08:51,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:51,838 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:08:51,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-17 09:08:52,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:08:52,049 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:52,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:52,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1341887012, now seen corresponding path program 1 times [2021-12-17 09:08:52,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:08:52,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131245680] [2021-12-17 09:08:52,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:52,051 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:08:52,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:08:52,053 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:08:52,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 09:08:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:52,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 09:08:52,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:08:52,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 09:08:52,196 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:08:52,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131245680] [2021-12-17 09:08:52,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131245680] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:08:52,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:08:52,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 09:08:52,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446063134] [2021-12-17 09:08:52,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:08:52,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 09:08:52,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:08:52,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 09:08:52,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 09:08:52,212 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 09:08:52,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:52,225 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2021-12-17 09:08:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 09:08:52,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-17 09:08:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:52,232 INFO L225 Difference]: With dead ends: 48 [2021-12-17 09:08:52,232 INFO L226 Difference]: Without dead ends: 29 [2021-12-17 09:08:52,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 09:08:52,234 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:08:52,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 55 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:08:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-17 09:08:52,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2021-12-17 09:08:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:08:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2021-12-17 09:08:52,240 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2021-12-17 09:08:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:52,241 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2021-12-17 09:08:52,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 09:08:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2021-12-17 09:08:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 09:08:52,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:52,242 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:08:52,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 09:08:52,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:08:52,451 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:52,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2097266908, now seen corresponding path program 1 times [2021-12-17 09:08:52,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:08:52,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040420849] [2021-12-17 09:08:52,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:52,452 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:08:52,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:08:52,454 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:08:52,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 09:08:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:52,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 09:08:52,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:08:52,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:08:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:08:52,715 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:08:52,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040420849] [2021-12-17 09:08:52,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040420849] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:08:52,716 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:08:52,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-17 09:08:52,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644808411] [2021-12-17 09:08:52,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:08:52,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 09:08:52,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:08:52,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 09:08:52,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 09:08:52,718 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-17 09:08:52,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:52,749 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2021-12-17 09:08:52,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 09:08:52,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2021-12-17 09:08:52,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:52,751 INFO L225 Difference]: With dead ends: 52 [2021-12-17 09:08:52,751 INFO L226 Difference]: Without dead ends: 33 [2021-12-17 09:08:52,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 09:08:52,753 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:08:52,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 84 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:08:52,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-17 09:08:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2021-12-17 09:08:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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) [2021-12-17 09:08:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-12-17 09:08:52,761 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 26 [2021-12-17 09:08:52,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:52,761 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-12-17 09:08:52,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-17 09:08:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-12-17 09:08:52,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 09:08:52,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:52,763 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:08:52,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-17 09:08:52,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:08:52,974 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:52,975 INFO L85 PathProgramCache]: Analyzing trace with hash -867054116, now seen corresponding path program 2 times [2021-12-17 09:08:52,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:08:52,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271378515] [2021-12-17 09:08:52,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:08:52,979 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:08:52,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:08:52,980 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:08:52,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 09:08:53,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-17 09:08:53,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:08:53,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-17 09:08:53,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:53,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:08:53,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-17 09:08:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-17 09:08:53,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 09:08:53,373 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:08:53,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271378515] [2021-12-17 09:08:53,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271378515] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:08:53,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:08:53,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 09:08:53,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776857273] [2021-12-17 09:08:53,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:08:53,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 09:08:53,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:08:53,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 09:08:53,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-17 09:08:53,376 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:08:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:53,549 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2021-12-17 09:08:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 09:08:53,549 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2021-12-17 09:08:53,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:53,550 INFO L225 Difference]: With dead ends: 43 [2021-12-17 09:08:53,551 INFO L226 Difference]: Without dead ends: 40 [2021-12-17 09:08:53,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-12-17 09:08:53,552 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:08:53,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 117 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:08:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-17 09:08:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2021-12-17 09:08:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) [2021-12-17 09:08:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2021-12-17 09:08:53,560 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 35 [2021-12-17 09:08:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:53,568 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-17 09:08:53,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:08:53,569 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-12-17 09:08:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 09:08:53,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:53,573 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:08:53,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-17 09:08:53,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:08:53,784 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:53,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:53,785 INFO L85 PathProgramCache]: Analyzing trace with hash -867052442, now seen corresponding path program 1 times [2021-12-17 09:08:53,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:08:53,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935012425] [2021-12-17 09:08:53,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:53,787 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:08:53,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:08:53,788 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:08:53,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 09:08:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:53,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 09:08:53,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:54,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:08:54,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-17 09:08:54,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:54,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-17 09:08:54,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-17 09:08:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:08:54,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:08:54,698 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:08:54,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935012425] [2021-12-17 09:08:54,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935012425] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:54,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [387248316] [2021-12-17 09:08:54,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:54,699 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:08:54,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:08:54,701 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 09:08:54,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2021-12-17 09:08:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:54,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 09:08:54,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:55,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-17 09:08:55,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:55,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-17 09:08:55,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-17 09:08:55,432 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:08:55,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:08:55,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [387248316] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:55,535 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:08:55,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2021-12-17 09:08:55,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172961247] [2021-12-17 09:08:55,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:08:55,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 09:08:55,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:08:55,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 09:08:55,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=416, Unknown=10, NotChecked=0, Total=506 [2021-12-17 09:08:55,537 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 21 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 09:08:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:55,915 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2021-12-17 09:08:55,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 09:08:55,918 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2021-12-17 09:08:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:55,918 INFO L225 Difference]: With dead ends: 37 [2021-12-17 09:08:55,919 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 09:08:55,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=575, Unknown=12, NotChecked=0, Total=702 [2021-12-17 09:08:55,920 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:08:55,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 214 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 33 Unchecked, 0.3s Time] [2021-12-17 09:08:55,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 09:08:55,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-17 09:08:55,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 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) [2021-12-17 09:08:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-12-17 09:08:55,925 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 35 [2021-12-17 09:08:55,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:55,925 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-17 09:08:55,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 09:08:55,925 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-12-17 09:08:55,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 09:08:55,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:55,926 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:08:55,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2021-12-17 09:08:56,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-17 09:08:56,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:08:56,337 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:56,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:56,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1386356248, now seen corresponding path program 1 times [2021-12-17 09:08:56,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:08:56,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902912365] [2021-12-17 09:08:56,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:56,338 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:08:56,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:08:56,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:08:56,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-17 09:08:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:56,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-17 09:08:56,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:56,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:08:56,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:08:56,949 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:08:56,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2021-12-17 09:08:56,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:08:57,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:57,201 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-17 09:08:57,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2021-12-17 09:08:57,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:57,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 09:08:57,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:08:57,719 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:08:57,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 32 [2021-12-17 09:08:57,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-12-17 09:08:57,865 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:08:57,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:08:57,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-17 09:08:58,359 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:08:58,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902912365] [2021-12-17 09:08:58,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902912365] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:58,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1850224150] [2021-12-17 09:08:58,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:58,361 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:08:58,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:08:58,362 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 09:08:58,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2021-12-17 09:08:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:58,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-17 09:08:58,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:59,169 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-17 09:08:59,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 49 [2021-12-17 09:08:59,200 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 09:08:59,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2021-12-17 09:08:59,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-17 09:08:59,392 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:08:59,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-17 09:08:59,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2021-12-17 09:08:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-17 09:08:59,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 09:08:59,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1850224150] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:08:59,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 09:08:59,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [23] total 32 [2021-12-17 09:08:59,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469096745] [2021-12-17 09:08:59,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:08:59,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 09:08:59,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:08:59,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 09:08:59,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1273, Unknown=8, NotChecked=72, Total=1482 [2021-12-17 09:08:59,463 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:08:59,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:59,707 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2021-12-17 09:08:59,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 09:08:59,707 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2021-12-17 09:08:59,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:59,708 INFO L225 Difference]: With dead ends: 40 [2021-12-17 09:08:59,708 INFO L226 Difference]: Without dead ends: 37 [2021-12-17 09:08:59,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=143, Invalid=1493, Unknown=8, NotChecked=78, Total=1722 [2021-12-17 09:08:59,710 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:08:59,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 125 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 13 Unchecked, 0.1s Time] [2021-12-17 09:08:59,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-17 09:08:59,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2021-12-17 09:08:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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) [2021-12-17 09:08:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2021-12-17 09:08:59,716 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 38 [2021-12-17 09:08:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:59,716 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2021-12-17 09:08:59,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:08:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2021-12-17 09:08:59,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 09:08:59,717 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:59,717 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:08:59,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2021-12-17 09:08:59,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-17 09:09:00,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:09:00,122 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:09:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:09:00,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1386357922, now seen corresponding path program 1 times [2021-12-17 09:09:00,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:09:00,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940855257] [2021-12-17 09:09:00,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:09:00,123 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:09:00,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:09:00,124 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:09:00,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-17 09:09:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:09:00,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-17 09:09:00,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:09:00,479 INFO L388 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 6 treesize of output 5 [2021-12-17 09:09:00,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:09:00,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:09:00,844 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:09:00,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 34 [2021-12-17 09:09:00,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2021-12-17 09:09:00,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 09:09:01,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:01,102 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:09:01,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2021-12-17 09:09:01,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:01,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2021-12-17 09:09:01,131 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 09:09:01,132 INFO L388 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 18 treesize of output 18 [2021-12-17 09:09:01,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-12-17 09:09:01,369 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:09:01,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2021-12-17 09:09:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:09:01,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:09:01,678 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:09:01,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940855257] [2021-12-17 09:09:01,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940855257] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:09:01,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1232774099] [2021-12-17 09:09:01,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:09:01,678 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:09:01,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:09:01,684 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 09:09:01,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2021-12-17 09:09:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:09:01,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-17 09:09:01,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:09:02,227 INFO L388 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 6 treesize of output 5 [2021-12-17 09:09:02,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:09:02,638 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:09:02,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2021-12-17 09:09:02,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:09:02,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:02,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 09:09:02,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:02,853 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:09:02,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2021-12-17 09:09:02,867 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 09:09:02,868 INFO L388 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 18 treesize of output 18 [2021-12-17 09:09:02,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:09:03,126 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:09:03,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2021-12-17 09:09:03,137 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:09:03,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:09:03,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1232774099] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:09:03,308 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:09:03,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2021-12-17 09:09:03,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376258916] [2021-12-17 09:09:03,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:09:03,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-17 09:09:03,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:09:03,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-17 09:09:03,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1318, Unknown=6, NotChecked=0, Total=1482 [2021-12-17 09:09:03,310 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 36 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 28 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:09:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:09:04,289 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2021-12-17 09:09:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 09:09:04,291 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 28 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2021-12-17 09:09:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:09:04,292 INFO L225 Difference]: With dead ends: 41 [2021-12-17 09:09:04,293 INFO L226 Difference]: Without dead ends: 33 [2021-12-17 09:09:04,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=275, Invalid=1971, Unknown=10, NotChecked=0, Total=2256 [2021-12-17 09:09:04,294 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:09:04,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 327 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 230 Invalid, 0 Unknown, 49 Unchecked, 0.4s Time] [2021-12-17 09:09:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-17 09:09:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-12-17 09:09:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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) [2021-12-17 09:09:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2021-12-17 09:09:04,300 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 38 [2021-12-17 09:09:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:09:04,301 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2021-12-17 09:09:04,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 28 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:09:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2021-12-17 09:09:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 09:09:04,302 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:09:04,302 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:09:04,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2021-12-17 09:09:04,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-17 09:09:04,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:09:04,706 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:09:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:09:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash 403579891, now seen corresponding path program 1 times [2021-12-17 09:09:04,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:09:04,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280068024] [2021-12-17 09:09:04,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:09:04,708 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:09:04,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:09:04,709 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:09:04,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-17 09:09:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:09:04,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-17 09:09:04,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:09:05,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:09:05,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:09:05,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:09:05,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-12-17 09:09:05,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 09:09:05,323 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:09:05,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:09:05,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:05,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-17 09:09:05,540 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 09:09:05,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-12-17 09:09:05,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:05,558 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:09:05,558 INFO L388 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 1 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 09:09:05,867 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-12-17 09:09:05,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 18 [2021-12-17 09:09:05,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-12-17 09:09:06,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-17 09:09:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:09:06,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:09:08,203 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| (_ BitVec 32)) (v_ArrVal_583 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32)) v_ArrVal_583)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-17 09:09:10,222 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.base_13| (_ BitVec 32)) (v_ArrVal_583 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_13| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_13|) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))) (_ bv4 32)) v_ArrVal_583)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-17 09:09:12,245 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.base_13| (_ BitVec 32)) (v_ArrVal_583 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_13| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_13|) (bvadd (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32))) (_ bv4 32)) v_ArrVal_583)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-17 09:09:12,484 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:09:12,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280068024] [2021-12-17 09:09:12,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280068024] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:09:12,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [147004250] [2021-12-17 09:09:12,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:09:12,485 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:09:12,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:09:12,488 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 09:09:12,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2021-12-17 09:09:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:09:12,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-17 09:09:12,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:09:13,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:09:13,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:09:13,753 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:09:13,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 19 [2021-12-17 09:09:13,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:09:13,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:13,996 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:09:13,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 42 [2021-12-17 09:09:14,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:14,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 09:09:14,026 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 09:09:14,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-12-17 09:09:14,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:09:14,634 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-17 09:09:14,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2021-12-17 09:09:14,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 09:09:14,950 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:09:14,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2021-12-17 09:09:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:09:14,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:09:15,028 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-17 09:09:15,040 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))) v_ArrVal_651) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-17 09:09:15,051 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32))) v_ArrVal_651) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-17 09:09:15,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [147004250] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:09:15,268 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:09:15,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 38 [2021-12-17 09:09:15,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651787956] [2021-12-17 09:09:15,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:09:15,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-17 09:09:15,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:09:15,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-17 09:09:15,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1462, Unknown=19, NotChecked=498, Total=2162 [2021-12-17 09:09:15,271 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 38 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 30 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-17 09:09:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:09:16,295 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2021-12-17 09:09:16,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 09:09:16,296 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 30 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2021-12-17 09:09:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:09:16,297 INFO L225 Difference]: With dead ends: 45 [2021-12-17 09:09:16,297 INFO L226 Difference]: Without dead ends: 42 [2021-12-17 09:09:16,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=303, Invalid=2353, Unknown=20, NotChecked=630, Total=3306 [2021-12-17 09:09:16,299 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:09:16,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 274 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 180 Invalid, 0 Unknown, 74 Unchecked, 0.3s Time] [2021-12-17 09:09:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-17 09:09:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2021-12-17 09:09:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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) [2021-12-17 09:09:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2021-12-17 09:09:16,305 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 40 [2021-12-17 09:09:16,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:09:16,305 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2021-12-17 09:09:16,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 30 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-17 09:09:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2021-12-17 09:09:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 09:09:16,306 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:09:16,306 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:09:16,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2021-12-17 09:09:16,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-17 09:09:16,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:09:16,711 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:09:16,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:09:16,711 INFO L85 PathProgramCache]: Analyzing trace with hash 403581565, now seen corresponding path program 1 times [2021-12-17 09:09:16,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:09:16,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702589093] [2021-12-17 09:09:16,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:09:16,712 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:09:16,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:09:16,713 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:09:16,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-17 09:09:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:09:16,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-17 09:09:16,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:09:16,967 INFO L388 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 6 treesize of output 5 [2021-12-17 09:09:17,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 09:09:17,118 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:09:17,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 09:09:17,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 09:09:17,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:09:17,446 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 09:09:17,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 46 [2021-12-17 09:09:17,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:09:17,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:09:17,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-17 09:09:17,961 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:09:17,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2021-12-17 09:09:17,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:09:17,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2021-12-17 09:09:17,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:09:18,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:18,307 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:09:18,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 71 [2021-12-17 09:09:18,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:18,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 09:09:18,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:18,368 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:09:18,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 45 [2021-12-17 09:09:18,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:18,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 09:09:19,308 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-17 09:09:19,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 101 [2021-12-17 09:09:19,330 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 09:09:19,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2021-12-17 09:09:19,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:19,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-17 09:09:19,505 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:09:19,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 34 [2021-12-17 09:09:19,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:09:19,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:09:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:09:19,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:09:19,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_729) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-17 09:09:19,821 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_729) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_728) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-17 09:09:19,846 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_729) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_728) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-17 09:09:20,140 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:09:20,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702589093] [2021-12-17 09:09:20,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702589093] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:09:20,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [718683150] [2021-12-17 09:09:20,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:09:20,141 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:09:20,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:09:20,142 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 09:09:20,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2021-12-17 09:09:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:09:20,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-17 09:09:20,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:09:20,558 INFO L388 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 6 treesize of output 5 [2021-12-17 09:09:20,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 09:09:21,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:09:21,264 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:09:21,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 09:09:21,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:21,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 09:09:21,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:09:21,927 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:09:21,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 35 [2021-12-17 09:09:21,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:09:21,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:09:21,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 09:09:22,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:22,202 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:09:22,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 64 [2021-12-17 09:09:22,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:22,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 09:09:22,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:22,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 09:09:22,254 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:09:22,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2021-12-17 09:09:23,224 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-17 09:09:23,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 94 [2021-12-17 09:09:23,249 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 09:09:23,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2021-12-17 09:09:23,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:23,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-17 09:09:23,463 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:09:23,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2021-12-17 09:09:23,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:09:23,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:09:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:09:23,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:09:23,603 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_809) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_810) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_811) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-17 09:09:23,626 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_809) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_810) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_811) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-17 09:09:23,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_809) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_810) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_811) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-17 09:09:26,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [718683150] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:09:26,829 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:09:26,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 41 [2021-12-17 09:09:26,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917717925] [2021-12-17 09:09:26,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:09:26,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-17 09:09:26,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:09:26,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-17 09:09:26,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1905, Unknown=23, NotChecked=558, Total=2652 [2021-12-17 09:09:26,831 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 41 states, 39 states have (on average 1.564102564102564) internal successors, (61), 32 states have internal predecessors, (61), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:09:29,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:09:29,416 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2021-12-17 09:09:29,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 09:09:29,416 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.564102564102564) internal successors, (61), 32 states have internal predecessors, (61), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2021-12-17 09:09:29,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:09:29,417 INFO L225 Difference]: With dead ends: 42 [2021-12-17 09:09:29,417 INFO L226 Difference]: Without dead ends: 40 [2021-12-17 09:09:29,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=297, Invalid=3243, Unknown=24, NotChecked=726, Total=4290 [2021-12-17 09:09:29,419 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:09:29,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 358 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 261 Invalid, 0 Unknown, 108 Unchecked, 0.4s Time] [2021-12-17 09:09:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-17 09:09:29,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2021-12-17 09:09:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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) [2021-12-17 09:09:29,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2021-12-17 09:09:29,426 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 40 [2021-12-17 09:09:29,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:09:29,426 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2021-12-17 09:09:29,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.564102564102564) internal successors, (61), 32 states have internal predecessors, (61), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:09:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2021-12-17 09:09:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 09:09:29,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:09:29,427 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:09:29,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2021-12-17 09:09:29,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-17 09:09:29,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:09:29,832 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:09:29,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:09:29,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1294860110, now seen corresponding path program 1 times [2021-12-17 09:09:29,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:09:29,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804765395] [2021-12-17 09:09:29,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:09:29,833 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:09:29,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:09:29,834 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:09:29,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-17 09:09:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:09:30,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-17 09:09:30,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:09:30,040 INFO L388 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 6 treesize of output 5 [2021-12-17 09:09:30,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 09:09:30,141 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 09:09:30,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 09:09:30,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:09:30,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:09:30,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:09:30,623 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-17 09:09:30,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 40 [2021-12-17 09:09:30,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 09:09:30,643 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:09:30,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:09:30,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:30,870 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:09:30,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 58 [2021-12-17 09:09:30,891 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 09:09:30,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-12-17 09:09:30,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:30,916 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:09:30,917 INFO L388 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 1 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 09:09:31,750 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-12-17 09:09:31,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 129 treesize of output 102 [2021-12-17 09:09:31,791 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-12-17 09:09:31,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 78 [2021-12-17 09:09:31,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2021-12-17 09:09:31,925 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 09:09:31,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 28 [2021-12-17 09:09:32,109 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-17 09:09:32,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 36 [2021-12-17 09:09:32,245 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:09:32,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:09:32,398 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_887))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) is different from false [2021-12-17 09:09:33,252 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:09:33,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804765395] [2021-12-17 09:09:33,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804765395] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:09:33,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1741678099] [2021-12-17 09:09:33,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:09:33,252 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:09:33,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:09:33,253 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 09:09:33,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2021-12-17 09:09:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:09:33,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-17 09:09:33,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:09:33,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:09:34,355 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:09:34,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 09:09:34,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:09:35,048 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:09:35,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 36 [2021-12-17 09:09:35,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 14 [2021-12-17 09:09:35,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:09:35,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:35,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 09:09:35,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:35,576 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:09:35,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 67 [2021-12-17 09:09:35,615 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:09:35,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 35 treesize of output 37 [2021-12-17 09:09:37,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:09:37,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:09:37,374 INFO L354 Elim1Store]: treesize reduction 152, result has 16.0 percent of original size [2021-12-17 09:09:37,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 169 treesize of output 83 [2021-12-17 09:09:37,400 INFO L354 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2021-12-17 09:09:37,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2021-12-17 09:09:37,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:09:37,917 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:09:37,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 30 [2021-12-17 09:09:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:09:38,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:09:58,874 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (_ BitVec 32)) (v_ArrVal_956 (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_28| (_ BitVec 32))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1)) (.cse3 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_28| (_ bv4 32)))) (or (not (= (_ bv0 32) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 (store .cse2 .cse3 v_ArrVal_956)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse3 v_ArrVal_957)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))) (not (= (_ bv0 32) (select .cse2 .cse3))))))) is different from false [2021-12-17 09:10:40,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1741678099] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:10:40,300 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:10:40,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 48 [2021-12-17 09:10:40,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897512745] [2021-12-17 09:10:40,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:10:40,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-17 09:10:40,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:10:40,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-17 09:10:40,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=3243, Unknown=53, NotChecked=234, Total=3782 [2021-12-17 09:10:40,303 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 48 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 40 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:10:43,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:10:43,485 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2021-12-17 09:10:43,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-17 09:10:43,485 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 40 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2021-12-17 09:10:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:10:43,487 INFO L225 Difference]: With dead ends: 47 [2021-12-17 09:10:43,487 INFO L226 Difference]: Without dead ends: 44 [2021-12-17 09:10:43,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1548 ImplicationChecksByTransitivity, 69.5s TimeCoverageRelationStatistics Valid=434, Invalid=5371, Unknown=55, NotChecked=302, Total=6162 [2021-12-17 09:10:43,489 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:10:43,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 365 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 155 Unchecked, 0.2s Time] [2021-12-17 09:10:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-17 09:10:43,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2021-12-17 09:10:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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) [2021-12-17 09:10:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2021-12-17 09:10:43,496 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 42 [2021-12-17 09:10:43,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:10:43,496 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2021-12-17 09:10:43,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 40 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:10:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2021-12-17 09:10:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 09:10:43,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:10:43,497 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:10:43,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2021-12-17 09:10:43,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-17 09:10:43,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:10:43,899 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:10:43,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:10:43,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1294861784, now seen corresponding path program 1 times [2021-12-17 09:10:43,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:10:43,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632055541] [2021-12-17 09:10:43,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:43,900 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:10:43,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:10:43,903 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:10:43,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-17 09:10:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:44,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 96 conjunts are in the unsatisfiable core [2021-12-17 09:10:44,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:10:44,217 INFO L388 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 6 treesize of output 5 [2021-12-17 09:10:44,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 09:10:44,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:10:44,424 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:10:44,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 09:10:44,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:44,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 09:10:44,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 09:10:44,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:10:44,809 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 09:10:44,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-17 09:10:44,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-17 09:10:44,876 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 09:10:44,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 46 [2021-12-17 09:10:45,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:10:45,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:10:45,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 09:10:45,487 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:10:45,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 51 [2021-12-17 09:10:45,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:10:45,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:10:45,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-12-17 09:10:45,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:45,803 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:10:45,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 86 [2021-12-17 09:10:45,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:45,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-17 09:10:45,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:45,856 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:10:45,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 45 [2021-12-17 09:10:45,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:45,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 09:10:47,315 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-12-17 09:10:47,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 207 treesize of output 158 [2021-12-17 09:10:47,360 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-12-17 09:10:47,360 INFO L388 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 2 case distinctions, treesize of input 137 treesize of output 121 [2021-12-17 09:10:47,369 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:47,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:47,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 56 [2021-12-17 09:10:47,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2021-12-17 09:10:48,002 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:48,014 INFO L354 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2021-12-17 09:10:48,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 61 [2021-12-17 09:10:48,036 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-17 09:10:48,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2021-12-17 09:10:48,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:10:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:48,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:10:48,682 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1042)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1041))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32)) v_ArrVal_1040)) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2021-12-17 09:10:52,277 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:10:52,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632055541] [2021-12-17 09:10:52,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632055541] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:10:52,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [716609114] [2021-12-17 09:10:52,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:52,278 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:10:52,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:10:52,278 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 09:10:52,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2021-12-17 09:10:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:52,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 87 conjunts are in the unsatisfiable core [2021-12-17 09:10:52,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:10:52,874 INFO L388 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 6 treesize of output 5 [2021-12-17 09:10:53,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:10:53,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:53,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 09:10:53,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 09:10:53,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:10:54,131 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:10:54,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 09:10:54,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 09:10:54,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:10:54,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:10:54,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-17 09:10:55,170 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:10:55,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2021-12-17 09:10:55,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 09:10:55,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:10:55,192 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:10:55,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:10:55,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:55,527 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:10:55,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 73 [2021-12-17 09:10:55,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:55,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-17 09:10:55,578 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:10:55,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2021-12-17 09:10:55,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:55,602 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:10:55,603 INFO L388 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 1 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 09:10:57,029 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-17 09:10:57,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 130 [2021-12-17 09:10:57,097 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-12-17 09:10:57,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 88 [2021-12-17 09:10:57,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:57,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:57,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 56 [2021-12-17 09:10:58,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:58,497 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:10:58,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 52 [2021-12-17 09:10:58,520 INFO L354 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2021-12-17 09:10:58,521 INFO L388 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2021-12-17 09:10:58,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:10:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:58,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:10:58,996 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1127 (_ BitVec 32)) (v_ArrVal_1128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1128)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1129))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32)) v_ArrVal_1127)) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2021-12-17 09:10:59,043 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1127 (_ BitVec 32)) (v_ArrVal_1128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1128)) (.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1129))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1) (_ bv4 32)) v_ArrVal_1127)) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2021-12-17 09:10:59,078 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1127 (_ BitVec 32)) (v_ArrVal_1128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse2 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1128)) (.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1129))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) (_ bv4 32)) v_ArrVal_1127)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))) is different from false [2021-12-17 09:11:04,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [716609114] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:11:04,289 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:11:04,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 49 [2021-12-17 09:11:04,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405016915] [2021-12-17 09:11:04,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:11:04,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-17 09:11:04,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:11:04,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-17 09:11:04,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3307, Unknown=34, NotChecked=476, Total=4032 [2021-12-17 09:11:04,292 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 49 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 39 states have internal predecessors, (66), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:11:08,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:11:08,770 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2021-12-17 09:11:08,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-17 09:11:08,771 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 39 states have internal predecessors, (66), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2021-12-17 09:11:08,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:11:08,772 INFO L225 Difference]: With dead ends: 67 [2021-12-17 09:11:08,772 INFO L226 Difference]: Without dead ends: 65 [2021-12-17 09:11:08,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=344, Invalid=5337, Unknown=35, NotChecked=604, Total=6320 [2021-12-17 09:11:08,774 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 09:11:08,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 405 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 244 Invalid, 0 Unknown, 201 Unchecked, 0.5s Time] [2021-12-17 09:11:08,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-17 09:11:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2021-12-17 09:11:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 56 states have internal predecessors, (62), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:11:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2021-12-17 09:11:08,785 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 42 [2021-12-17 09:11:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:11:08,786 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2021-12-17 09:11:08,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 39 states have internal predecessors, (66), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:11:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2021-12-17 09:11:08,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 09:11:08,787 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:11:08,787 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:11:08,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2021-12-17 09:11:09,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-17 09:11:09,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:11:09,192 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:11:09,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:11:09,192 INFO L85 PathProgramCache]: Analyzing trace with hash 848305934, now seen corresponding path program 2 times [2021-12-17 09:11:09,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:11:09,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278659984] [2021-12-17 09:11:09,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:11:09,193 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:11:09,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:11:09,193 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:11:09,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-17 09:11:09,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-17 09:11:09,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:11:09,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-17 09:11:09,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:11:09,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:11:09,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:11:09,890 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-17 09:11:09,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 40 [2021-12-17 09:11:09,951 INFO L354 Elim1Store]: treesize reduction 18, result has 64.0 percent of original size [2021-12-17 09:11:09,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 53 [2021-12-17 09:11:10,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-17 09:11:10,374 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:11:10,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2021-12-17 09:11:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 09:11:10,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 09:11:10,441 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:11:10,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278659984] [2021-12-17 09:11:10,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278659984] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:11:10,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:11:10,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-17 09:11:10,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881824070] [2021-12-17 09:11:10,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:11:10,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 09:11:10,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:11:10,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 09:11:10,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=172, Unknown=2, NotChecked=0, Total=210 [2021-12-17 09:11:10,443 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:11:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:11:10,574 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2021-12-17 09:11:10,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 09:11:10,575 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2021-12-17 09:11:10,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:11:10,575 INFO L225 Difference]: With dead ends: 70 [2021-12-17 09:11:10,575 INFO L226 Difference]: Without dead ends: 67 [2021-12-17 09:11:10,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=172, Unknown=2, NotChecked=0, Total=210 [2021-12-17 09:11:10,576 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:11:10,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 115 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2021-12-17 09:11:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-17 09:11:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2021-12-17 09:11:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 56 states have internal predecessors, (62), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:11:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2021-12-17 09:11:10,587 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 42 [2021-12-17 09:11:10,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:11:10,587 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2021-12-17 09:11:10,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 09:11:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2021-12-17 09:11:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 09:11:10,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:11:10,588 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:11:10,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-17 09:11:10,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:11:10,810 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:11:10,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:11:10,811 INFO L85 PathProgramCache]: Analyzing trace with hash 848307608, now seen corresponding path program 2 times [2021-12-17 09:11:10,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:11:10,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292191675] [2021-12-17 09:11:10,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:11:10,811 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:11:10,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:11:10,812 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:11:10,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-17 09:11:11,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:11:11,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:11:11,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-17 09:11:11,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:11:11,102 INFO L388 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 6 treesize of output 5 [2021-12-17 09:11:11,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:11:11,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:11:11,491 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 09:11:11,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-17 09:11:11,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:11:11,536 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:11:11,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 09:11:11,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 09:11:11,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 09:11:11,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2021-12-17 09:11:11,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:11:11,959 INFO L354 Elim1Store]: treesize reduction 11, result has 71.8 percent of original size [2021-12-17 09:11:11,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 78 [2021-12-17 09:11:11,972 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-17 09:11:11,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 26 [2021-12-17 09:11:11,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 09:11:12,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:12,207 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-17 09:11:12,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 123 treesize of output 113 [2021-12-17 09:11:12,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:12,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:12,235 INFO L354 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2021-12-17 09:11:12,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 119 [2021-12-17 09:11:12,264 INFO L354 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2021-12-17 09:11:12,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 43 [2021-12-17 09:11:13,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:11:13,214 INFO L354 Elim1Store]: treesize reduction 46, result has 40.3 percent of original size [2021-12-17 09:11:13,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 182 treesize of output 109 [2021-12-17 09:11:13,241 INFO L354 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2021-12-17 09:11:13,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 51 [2021-12-17 09:11:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:11:13,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:11:13,775 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:11:13,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292191675] [2021-12-17 09:11:13,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292191675] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:11:13,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1155478930] [2021-12-17 09:11:13,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:11:13,776 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:11:13,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:11:13,777 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 09:11:13,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2021-12-17 09:11:14,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:11:14,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:11:14,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 105 conjunts are in the unsatisfiable core [2021-12-17 09:11:14,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:11:14,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 09:11:14,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:11:14,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:11:15,139 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:11:15,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 09:11:15,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 09:11:15,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:11:15,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 09:11:15,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-17 09:11:15,981 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:11:15,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 57 [2021-12-17 09:11:15,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:15,997 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:11:15,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-17 09:11:16,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 09:11:16,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 14 [2021-12-17 09:11:20,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:20,631 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 09:11:20,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 85 [2021-12-17 09:11:20,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:20,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 09:11:20,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:20,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:20,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:20,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:20,671 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:11:20,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 57 [2021-12-17 09:11:20,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:20,691 INFO L354 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2021-12-17 09:11:20,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2021-12-17 09:11:23,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:23,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:23,978 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:11:24,162 INFO L354 Elim1Store]: treesize reduction 279, result has 12.5 percent of original size [2021-12-17 09:11:24,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 19 case distinctions, treesize of input 457 treesize of output 169 [2021-12-17 09:11:24,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:24,400 INFO L354 Elim1Store]: treesize reduction 424, result has 10.7 percent of original size [2021-12-17 09:11:24,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 19 case distinctions, treesize of input 534 treesize of output 277 [2021-12-17 09:11:24,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:24,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2021-12-17 09:11:24,895 INFO L354 Elim1Store]: treesize reduction 48, result has 34.2 percent of original size [2021-12-17 09:11:24,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 341 treesize of output 116 [2021-12-17 09:11:24,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:24,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:24,920 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:11:24,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 25 [2021-12-17 09:11:25,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:11:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:11:25,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:11:25,738 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (_ BitVec 32)) (v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1357) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_1358)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-17 09:11:48,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1155478930] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:11:48,751 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:11:48,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29] total 47 [2021-12-17 09:11:48,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834792555] [2021-12-17 09:11:48,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:11:48,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-17 09:11:48,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:11:48,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-17 09:11:48,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=3530, Unknown=28, NotChecked=120, Total=3906 [2021-12-17 09:11:48,753 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 47 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 38 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:12:00,481 WARN L227 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 82 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 09:12:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:12:03,883 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2021-12-17 09:12:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-17 09:12:03,883 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 38 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2021-12-17 09:12:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:12:03,884 INFO L225 Difference]: With dead ends: 90 [2021-12-17 09:12:03,884 INFO L226 Difference]: Without dead ends: 80 [2021-12-17 09:12:03,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1851 ImplicationChecksByTransitivity, 45.2s TimeCoverageRelationStatistics Valid=427, Invalid=6350, Unknown=33, NotChecked=162, Total=6972 [2021-12-17 09:12:03,888 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 09:12:03,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 483 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 235 Invalid, 0 Unknown, 398 Unchecked, 0.5s Time] [2021-12-17 09:12:03,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-17 09:12:03,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2021-12-17 09:12:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:12:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2021-12-17 09:12:03,900 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 42 [2021-12-17 09:12:03,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:12:03,900 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2021-12-17 09:12:03,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 38 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:12:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2021-12-17 09:12:03,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 09:12:03,902 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:12:03,902 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:12:03,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2021-12-17 09:12:04,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-17 09:12:04,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:12:04,307 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:12:04,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:12:04,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1178308631, now seen corresponding path program 2 times [2021-12-17 09:12:04,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:12:04,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091449751] [2021-12-17 09:12:04,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:12:04,308 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:12:04,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:12:04,309 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:12:04,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-17 09:12:04,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:12:04,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:12:04,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 78 conjunts are in the unsatisfiable core [2021-12-17 09:12:04,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:12:04,574 INFO L388 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 6 treesize of output 5 [2021-12-17 09:12:04,928 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:12:04,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 09:12:05,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:12:05,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:12:05,365 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-17 09:12:05,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 45 [2021-12-17 09:12:05,377 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:12:05,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:12:05,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 09:12:05,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:12:05,665 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-12-17 09:12:05,665 INFO L388 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 25 treesize of output 34 [2021-12-17 09:12:05,700 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-17 09:12:05,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 69 [2021-12-17 09:12:05,731 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-17 09:12:05,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 33 [2021-12-17 09:12:05,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-17 09:12:05,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-12-17 09:12:06,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:12:06,911 INFO L354 Elim1Store]: treesize reduction 169, result has 12.4 percent of original size [2021-12-17 09:12:06,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 187 treesize of output 97 [2021-12-17 09:12:06,975 INFO L354 Elim1Store]: treesize reduction 136, result has 18.1 percent of original size [2021-12-17 09:12:06,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 243 treesize of output 159 [2021-12-17 09:12:07,399 INFO L354 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2021-12-17 09:12:07,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 124 [2021-12-17 09:12:07,788 INFO L354 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2021-12-17 09:12:07,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 51 [2021-12-17 09:12:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:12:07,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:12:13,568 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:12:13,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091449751] [2021-12-17 09:12:13,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091449751] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:12:13,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1599270975] [2021-12-17 09:12:13,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:12:13,569 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:12:13,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:12:13,570 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 09:12:13,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2021-12-17 09:12:13,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:12:13,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:12:13,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 74 conjunts are in the unsatisfiable core [2021-12-17 09:12:13,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:12:14,129 INFO L388 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 6 treesize of output 5 [2021-12-17 09:12:14,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 09:12:15,210 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:12:15,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 09:12:15,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:12:15,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:12:16,269 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:12:16,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 35 [2021-12-17 09:12:16,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 09:12:16,285 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:12:16,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:12:16,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:12:16,517 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:12:16,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 64 [2021-12-17 09:12:16,570 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:12:16,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2021-12-17 09:12:16,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:12:16,599 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:12:16,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 09:12:18,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:12:18,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:12:18,086 INFO L354 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2021-12-17 09:12:18,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 80 [2021-12-17 09:12:18,128 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-12-17 09:12:18,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 247 treesize of output 207 [2021-12-17 09:12:18,841 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-12-17 09:12:18,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 137 [2021-12-17 09:12:19,612 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 09:12:19,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 32 [2021-12-17 09:12:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:12:19,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:12:19,830 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1514 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1514)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (bvadd (select (select .cse3 .cse1) .cse2) (_ bv4 32)))))))) is different from false [2021-12-17 09:12:19,863 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1514 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse5 (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse5))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1514)) (.cse0 (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse5) (_ bv4 32)) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (bvadd (select (select .cse3 .cse1) .cse2) (_ bv4 32)))))))))) is different from false [2021-12-17 09:12:19,893 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1514 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse6 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1514)) (.cse0 (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (bvadd (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) (_ bv4 32)) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (bvadd (select (select .cse3 .cse1) .cse2) (_ bv4 32)))))))))) is different from false [2021-12-17 09:12:19,914 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1514 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse6 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1514)) (.cse0 (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (bvadd (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) (_ bv4 32)) |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (bvadd (select (select .cse3 .cse1) .cse2) (_ bv4 32)))))))))) is different from false [2021-12-17 09:12:20,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1599270975] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:12:20,870 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:12:20,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 51 [2021-12-17 09:12:20,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913081579] [2021-12-17 09:12:20,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:12:20,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-17 09:12:20,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:12:20,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-17 09:12:20,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=3871, Unknown=22, NotChecked=516, Total=4692 [2021-12-17 09:12:20,872 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 51 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 41 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:12:24,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:12:24,851 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2021-12-17 09:12:24,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 09:12:24,852 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 41 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2021-12-17 09:12:24,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:12:24,852 INFO L225 Difference]: With dead ends: 88 [2021-12-17 09:12:24,852 INFO L226 Difference]: Without dead ends: 85 [2021-12-17 09:12:24,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2216 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=438, Invalid=6197, Unknown=23, NotChecked=652, Total=7310 [2021-12-17 09:12:24,855 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:12:24,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 443 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 186 Unchecked, 0.3s Time] [2021-12-17 09:12:24,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-17 09:12:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2021-12-17 09:12:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 72 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:12:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2021-12-17 09:12:24,867 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 44 [2021-12-17 09:12:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:12:24,867 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2021-12-17 09:12:24,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 41 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:12:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2021-12-17 09:12:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 09:12:24,868 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:12:24,868 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:12:24,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2021-12-17 09:12:25,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-17 09:12:25,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:12:25,273 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:12:25,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:12:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1178306957, now seen corresponding path program 2 times [2021-12-17 09:12:25,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:12:25,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648124039] [2021-12-17 09:12:25,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:12:25,274 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:12:25,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:12:25,275 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:12:25,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-17 09:12:25,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:12:25,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:12:25,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 98 conjunts are in the unsatisfiable core [2021-12-17 09:12:25,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:12:25,599 INFO L388 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 6 treesize of output 5 [2021-12-17 09:12:25,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 09:12:25,774 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:12:25,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 09:12:25,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 09:12:26,074 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 09:12:26,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 46 [2021-12-17 09:12:26,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:12:26,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:12:26,619 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:12:26,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 44 [2021-12-17 09:12:26,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:12:26,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-12-17 09:12:26,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:12:26,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:12:26,931 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:12:26,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 77 [2021-12-17 09:12:26,975 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-17 09:12:26,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 49 [2021-12-17 09:12:26,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 09:12:28,356 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:12:28,442 INFO L354 Elim1Store]: treesize reduction 175, result has 9.3 percent of original size [2021-12-17 09:12:28,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 227 treesize of output 105 [2021-12-17 09:12:28,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2021-12-17 09:12:28,497 INFO L354 Elim1Store]: treesize reduction 112, result has 17.0 percent of original size [2021-12-17 09:12:28,497 INFO L388 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 204 treesize of output 147 [2021-12-17 09:12:29,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:12:29,696 INFO L354 Elim1Store]: treesize reduction 119, result has 8.5 percent of original size [2021-12-17 09:12:29,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 292 treesize of output 133 [2021-12-17 09:12:29,730 INFO L354 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2021-12-17 09:12:29,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 41 [2021-12-17 09:12:30,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-17 09:12:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:12:30,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:12:33,347 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:12:33,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1880 treesize of output 1872 [2021-12-17 09:12:33,629 INFO L354 Elim1Store]: treesize reduction 4, result has 99.9 percent of original size [2021-12-17 09:12:33,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4636 treesize of output 6449 [2021-12-17 09:12:33,697 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:12:33,698 INFO L388 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 2164 treesize of output 2168 [2021-12-17 09:13:00,177 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:13:00,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648124039] [2021-12-17 09:13:00,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648124039] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:13:00,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1083430784] [2021-12-17 09:13:00,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:13:00,178 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:13:00,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:13:00,180 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 09:13:00,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2021-12-17 09:13:00,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:13:00,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:13:00,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 91 conjunts are in the unsatisfiable core [2021-12-17 09:13:00,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:13:00,895 INFO L388 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 6 treesize of output 5 [2021-12-17 09:13:01,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 09:13:02,386 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:13:02,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 09:13:02,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:13:02,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:13:03,599 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:13:03,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 35 [2021-12-17 09:13:03,609 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:13:03,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:13:03,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 09:13:03,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:13:03,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:03,980 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:13:03,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 64 [2021-12-17 09:13:03,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:03,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:03,999 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:13:03,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 09:13:04,040 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:13:04,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2021-12-17 09:13:05,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:05,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:13:05,935 INFO L354 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2021-12-17 09:13:05,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 120 [2021-12-17 09:13:06,002 INFO L354 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2021-12-17 09:13:06,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 340 treesize of output 218 [2021-12-17 09:13:06,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 58 [2021-12-17 09:13:07,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:13:07,816 INFO L354 Elim1Store]: treesize reduction 89, result has 11.0 percent of original size [2021-12-17 09:13:07,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 240 treesize of output 107 [2021-12-17 09:13:07,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:07,857 INFO L354 Elim1Store]: treesize reduction 22, result has 24.1 percent of original size [2021-12-17 09:13:07,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 34 [2021-12-17 09:13:08,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:13:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:13:08,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:13:13,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20574 treesize of output 18050 [2021-12-17 09:14:09,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1083430784] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:14:09,465 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:14:09,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2021-12-17 09:14:09,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485531620] [2021-12-17 09:14:09,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:14:09,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-17 09:14:09,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:14:09,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-17 09:14:09,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=5719, Unknown=17, NotChecked=0, Total=6006 [2021-12-17 09:14:09,467 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 55 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 44 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:14:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:14:39,067 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2021-12-17 09:14:39,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-17 09:14:39,068 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 44 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2021-12-17 09:14:39,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:14:39,068 INFO L225 Difference]: With dead ends: 87 [2021-12-17 09:14:39,068 INFO L226 Difference]: Without dead ends: 85 [2021-12-17 09:14:39,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2794 ImplicationChecksByTransitivity, 102.3s TimeCoverageRelationStatistics Valid=446, Invalid=9235, Unknown=21, NotChecked=0, Total=9702 [2021-12-17 09:14:39,070 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:14:39,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 448 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 288 Unchecked, 0.4s Time] [2021-12-17 09:14:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-17 09:14:39,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2021-12-17 09:14:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 72 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:14:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2021-12-17 09:14:39,083 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 44 [2021-12-17 09:14:39,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:14:39,083 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2021-12-17 09:14:39,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 44 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:14:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2021-12-17 09:14:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-17 09:14:39,084 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:14:39,085 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:14:39,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-17 09:14:39,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2021-12-17 09:14:39,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-17 09:14:39,492 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:14:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:14:39,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1518413252, now seen corresponding path program 3 times [2021-12-17 09:14:39,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:14:39,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124705700] [2021-12-17 09:14:39,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 09:14:39,493 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:14:39,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:14:39,494 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:14:39,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-17 09:14:39,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 09:14:39,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:14:39,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 09:14:39,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:14:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-17 09:14:39,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:14:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-17 09:14:40,119 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:14:40,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124705700] [2021-12-17 09:14:40,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124705700] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:14:40,120 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:14:40,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-12-17 09:14:40,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577033830] [2021-12-17 09:14:40,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:14:40,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 09:14:40,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:14:40,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 09:14:40,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:14:40,121 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 09:14:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:14:40,241 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2021-12-17 09:14:40,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 09:14:40,241 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2021-12-17 09:14:40,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:14:40,242 INFO L225 Difference]: With dead ends: 104 [2021-12-17 09:14:40,242 INFO L226 Difference]: Without dead ends: 101 [2021-12-17 09:14:40,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:14:40,243 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:14:40,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 242 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:14:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-17 09:14:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2021-12-17 09:14:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 80 states have internal predecessors, (92), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:14:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2021-12-17 09:14:40,257 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 46 [2021-12-17 09:14:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:14:40,257 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2021-12-17 09:14:40,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 09:14:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2021-12-17 09:14:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-17 09:14:40,258 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:14:40,258 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:14:40,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-12-17 09:14:40,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:14:40,459 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:14:40,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:14:40,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1518414926, now seen corresponding path program 3 times [2021-12-17 09:14:40,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:14:40,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409747279] [2021-12-17 09:14:40,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 09:14:40,460 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:14:40,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:14:40,461 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:14:40,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-17 09:14:40,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 09:14:40,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:14:40,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 96 conjunts are in the unsatisfiable core [2021-12-17 09:14:40,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:14:40,881 INFO L388 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 6 treesize of output 5 [2021-12-17 09:14:40,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 09:14:41,144 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:14:41,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 09:14:41,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 09:14:41,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:41,531 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-17 09:14:41,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 24 treesize of output 32 [2021-12-17 09:14:41,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:14:41,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:14:42,159 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:14:42,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 39 [2021-12-17 09:14:42,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:42,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-17 09:14:42,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:42,190 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:14:42,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 27 treesize of output 21 [2021-12-17 09:14:46,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:46,723 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 09:14:46,727 INFO L388 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 2 case distinctions, treesize of input 82 treesize of output 67 [2021-12-17 09:14:46,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:46,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:46,796 INFO L354 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2021-12-17 09:14:46,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 44 [2021-12-17 09:14:46,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:46,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:46,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2021-12-17 09:14:48,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:48,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:48,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:14:48,614 INFO L354 Elim1Store]: treesize reduction 187, result has 15.8 percent of original size [2021-12-17 09:14:48,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 213 treesize of output 118 [2021-12-17 09:14:48,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:48,756 INFO L354 Elim1Store]: treesize reduction 164, result has 15.0 percent of original size [2021-12-17 09:14:48,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 319 treesize of output 201 [2021-12-17 09:14:50,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:14:50,592 INFO L354 Elim1Store]: treesize reduction 200, result has 8.3 percent of original size [2021-12-17 09:14:50,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 15 new quantified variables, introduced 21 case distinctions, treesize of input 357 treesize of output 158 [2021-12-17 09:14:50,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:50,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:50,654 INFO L354 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2021-12-17 09:14:50,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 45 [2021-12-17 09:14:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:14:50,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:15:07,887 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:15:07,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409747279] [2021-12-17 09:15:07,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409747279] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:15:07,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [331670813] [2021-12-17 09:15:07,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 09:15:07,888 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:15:07,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:15:07,889 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 09:15:07,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2021-12-17 09:15:08,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 09:15:08,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:15:08,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 92 conjunts are in the unsatisfiable core [2021-12-17 09:15:08,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:15:08,450 INFO L388 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 6 treesize of output 5 [2021-12-17 09:15:08,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 09:15:08,611 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:15:08,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 09:15:08,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 09:15:08,860 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 09:15:08,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 46 [2021-12-17 09:15:09,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:15:09,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 09:15:10,201 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:15:10,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2021-12-17 09:15:10,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2021-12-17 09:15:10,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:15:15,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:15,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:15,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:15:15,197 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 09:15:15,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 70 [2021-12-17 09:15:15,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:15,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:15,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:15,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2021-12-17 09:15:15,261 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-17 09:15:15,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 49 [2021-12-17 09:15:17,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:17,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:17,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:15:17,512 INFO L354 Elim1Store]: treesize reduction 143, result has 14.9 percent of original size [2021-12-17 09:15:17,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 185 treesize of output 106 [2021-12-17 09:15:17,540 INFO L354 Elim1Store]: treesize reduction 77, result has 8.3 percent of original size [2021-12-17 09:15:17,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 239 treesize of output 174 [2021-12-17 09:15:21,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:15:21,163 INFO L354 Elim1Store]: treesize reduction 204, result has 6.4 percent of original size [2021-12-17 09:15:21,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 15 new quantified variables, introduced 21 case distinctions, treesize of input 358 treesize of output 151 [2021-12-17 09:15:21,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:21,216 INFO L354 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2021-12-17 09:15:21,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 45 [2021-12-17 09:15:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:15:21,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:15:53,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [331670813] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:15:53,647 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:15:53,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 48 [2021-12-17 09:15:53,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490583297] [2021-12-17 09:15:53,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:15:53,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-17 09:15:53,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:15:53,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-17 09:15:53,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3946, Unknown=18, NotChecked=0, Total=4160 [2021-12-17 09:15:53,648 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 48 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 40 states have internal predecessors, (62), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-17 09:16:10,446 WARN L227 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 55 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 09:16:12,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:16:12,786 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2021-12-17 09:16:12,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-17 09:16:12,787 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 40 states have internal predecessors, (62), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 46 [2021-12-17 09:16:12,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:16:12,788 INFO L225 Difference]: With dead ends: 100 [2021-12-17 09:16:12,788 INFO L226 Difference]: Without dead ends: 72 [2021-12-17 09:16:12,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 83.4s TimeCoverageRelationStatistics Valid=293, Invalid=5848, Unknown=21, NotChecked=0, Total=6162 [2021-12-17 09:16:12,789 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:16:12,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 663 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 227 Unchecked, 0.4s Time] [2021-12-17 09:16:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-17 09:16:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2021-12-17 09:16:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 60 states have internal predecessors, (70), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-17 09:16:12,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2021-12-17 09:16:12,800 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 46 [2021-12-17 09:16:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:16:12,800 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2021-12-17 09:16:12,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 40 states have internal predecessors, (62), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-17 09:16:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2021-12-17 09:16:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-17 09:16:12,801 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:16:12,801 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:16:12,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2021-12-17 09:16:13,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-12-17 09:16:13,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:16:13,202 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:16:13,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:16:13,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1664871720, now seen corresponding path program 4 times [2021-12-17 09:16:13,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:16:13,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57029457] [2021-12-17 09:16:13,202 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 09:16:13,202 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:16:13,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:16:13,203 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:16:13,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-17 09:16:13,381 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 09:16:13,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:16:13,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 09:16:13,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:16:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-17 09:16:13,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:16:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-17 09:16:13,627 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:16:13,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57029457] [2021-12-17 09:16:13,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57029457] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:16:13,628 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:16:13,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-17 09:16:13,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622537979] [2021-12-17 09:16:13,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:16:13,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 09:16:13,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:16:13,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 09:16:13,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-17 09:16:13,629 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-17 09:16:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:16:13,677 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2021-12-17 09:16:13,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 09:16:13,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 51 [2021-12-17 09:16:13,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:16:13,678 INFO L225 Difference]: With dead ends: 73 [2021-12-17 09:16:13,678 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 09:16:13,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-17 09:16:13,679 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:16:13,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:16:13,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 09:16:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 09:16:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2021-12-17 09:16:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 09:16:13,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2021-12-17 09:16:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:16:13,680 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 09:16:13,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-17 09:16:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 09:16:13,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 09:16:13,682 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 09:16:13,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-12-17 09:16:13,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:16:13,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 09:16:21,736 WARN L227 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 284 DAG size of output: 170 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-17 09:16:25,744 INFO L858 garLoopResultBuilder]: For program point L605-1(lines 605 607) no Hoare annotation was computed. [2021-12-17 09:16:25,744 INFO L854 garLoopResultBuilder]: At program point L605-3(lines 605 607) the Hoare annotation is: (let ((.cse19 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse20 (select |#memory_$Pointer$.base| .cse19))) (let ((.cse17 (select .cse20 (_ bv4 32)))) (let ((.cse0 (not (= (_ bv0 32) |ULTIMATE.start_sll_append_~new_last~0#1.base|))) (.cse1 (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32))) (.cse7 (= |ULTIMATE.start_sll_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32))) (.cse10 (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse11 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (_ bv4 32)) (_ bv0 32))) (.cse12 (= (select (select |#memory_int| |ULTIMATE.start_sll_append_~new_last~0#1.base|) |ULTIMATE.start_sll_append_~new_last~0#1.offset|) |ULTIMATE.start_main_~data~0#1|)) (.cse13 (= (select (select |#memory_int| .cse19) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|)) (.cse14 (= (_ bv0 32) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (_ bv4 32)) (_ bv0 32))) (.cse16 (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| (_ bv0 32))) (.cse18 (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (let ((.cse31 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse32 (select (select |#memory_$Pointer$.base| .cse31) (_ bv4 32)))) (and (not (= .cse31 |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse32 |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (bvult .cse32 |#StackHeapBarrier|)))))) (.cse21 (= (select (select |#memory_int| .cse17) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|)) (.cse22 (not (= .cse17 |ULTIMATE.start_sll_append_~new_last~0#1.base|))) (.cse23 (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimIndex_66 (_ BitVec 32))) (and (not (= (_ bv0 32) v_arrayElimIndex_66)) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_append_~new_last~0#1.base| |#StackHeapBarrier|) (bvult v_arrayElimIndex_66 |#StackHeapBarrier|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|)))) (.cse24 (not (= (_ bv0 32) .cse19)))) (or (and .cse0 .cse1 (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_sll_append_~head#1.base| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_sll_append_~head#1.offset| (_ BitVec 32))) (let ((.cse5 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (.cse6 (bvadd .cse5 (_ bv4 32)))) (let ((.cse4 (select (select |#memory_$Pointer$.offset| .cse2) .cse6)) (.cse3 (select (select |#memory_$Pointer$.base| .cse2) .cse6))) (and (not (= .cse2 |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= .cse3 |node_create_~temp~0#1.base|)) (= .cse4 (_ bv0 32)) (not (= .cse2 .cse3)) (= (select (select |#memory_$Pointer$.offset| .cse3) (_ bv4 32)) (_ bv0 32)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= .cse5 (_ bv0 32)) (= |ULTIMATE.start_sll_append_~last~0#1.base| .cse3) (= |ULTIMATE.start_sll_append_~last~0#1.offset| .cse4) (= (select (select |#memory_$Pointer$.base| .cse3) (_ bv4 32)) (_ bv0 32))))))) .cse7 .cse8 (= .cse9 (_ bv0 32)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= (_ bv0 32) .cse17)) .cse18 (= (select (select |#memory_$Pointer$.offset| .cse19) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_sll_append_~last~0#1.base| (select .cse20 (bvadd .cse9 (_ bv4 32)))) .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_sll_append_~last~0#1.offset| .cse9) .cse15 .cse16 (= |ULTIMATE.start_sll_append_~last~0#1.base| .cse19) .cse18 .cse21 (exists ((|ULTIMATE.start_sll_append_~head#1.base| (_ BitVec 32)) (|ULTIMATE.start_sll_append_~head#1.offset| (_ BitVec 32))) (let ((.cse28 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse25 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (.cse26 (bvadd .cse28 (_ bv4 32)))) (let ((.cse27 (select (select |#memory_$Pointer$.base| .cse25) .cse26))) (and (= (select (select |#memory_$Pointer$.offset| .cse25) .cse26) (_ bv0 32)) (not (= .cse25 .cse27)) (= |ULTIMATE.start_sll_append_~last~0#1.offset| .cse28) (= (select (select |#memory_$Pointer$.offset| .cse27) (_ bv4 32)) (_ bv0 32)) (= .cse28 (_ bv0 32)) (= |ULTIMATE.start_sll_append_~last~0#1.base| .cse25) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (let ((.cse29 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))) (and (not (= .cse29 |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| .cse29) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32))) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|)))) (= (select (select |#memory_$Pointer$.base| .cse27) (_ bv4 32)) (_ bv0 32))))))) .cse22 .cse23 .cse24 (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_sll_append_~head#1.base| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (let ((.cse30 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) (_ bv0 32)))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse30) (_ bv4 32)))) (not (= .cse30 |node_create_~temp~0#1.base|)) (= |ULTIMATE.start_sll_append_~last~0#1.base| .cse30) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|)))))))))) [2021-12-17 09:16:25,745 INFO L858 garLoopResultBuilder]: For program point L601(lines 601 609) no Hoare annotation was computed. [2021-12-17 09:16:25,745 INFO L858 garLoopResultBuilder]: For program point L605-4(lines 605 607) no Hoare annotation was computed. [2021-12-17 09:16:25,745 INFO L861 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2021-12-17 09:16:25,745 INFO L854 garLoopResultBuilder]: At program point L618-2(lines 618 625) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |ULTIMATE.start_sll_append_~new_last~0#1.base|))) (.cse1 (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32))) (.cse2 (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32))) (.cse3 (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|)) (.cse4 (= |ULTIMATE.start_sll_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~ptr~0#1.offset| (_ bv0 32))) (.cse6 (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimIndex_66 (_ BitVec 32)) (v_arrayElimCell_331 (_ BitVec 32))) (and (not (= (_ bv0 32) v_arrayElimIndex_66)) (bvult v_arrayElimCell_331 |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_331)) (bvult |ULTIMATE.start_main_~ptr~0#1.base| |#StackHeapBarrier|) (bvult v_arrayElimIndex_66 |#StackHeapBarrier|) (not (= (_ bv0 32) (bvadd |#StackHeapBarrier| (_ bv1 32))))))) (.cse7 (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse17 (not (= (_ bv0 32) |ULTIMATE.start_main_~ptr~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse15 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse16 (select |#memory_$Pointer$.offset| .cse15))) (let ((.cse8 (select .cse16 (_ bv4 32))) (.cse13 (select |#memory_$Pointer$.base| .cse15))) (let ((.cse11 (select .cse13 (_ bv4 32))) (.cse12 (bvadd .cse8 (_ bv4 32))) (.cse10 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse14 (bvadd .cse10 (_ bv4 32))) (.cse9 (select (select |#memory_$Pointer$.base| .cse11) .cse12))) (and (= (_ bv0 32) .cse8) (bvult .cse9 |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| .cse9) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (= .cse10 (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| .cse11) .cse12) (_ bv0 32)) (= |ULTIMATE.start_main_~ptr~0#1.base| (select .cse13 .cse14)) (not (= .cse15 .cse9)) (= |ULTIMATE.start_main_~ptr~0#1.offset| (select .cse16 .cse14)) (not (= .cse11 .cse9)) (bvult .cse11 |#StackHeapBarrier|)))))))) (= |ULTIMATE.start_main_~count~0#1| (_ bv1 32)) .cse17 (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse20 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse26 (select |#memory_$Pointer$.offset| .cse20))) (let ((.cse18 (select .cse26 (_ bv4 32))) (.cse24 (select |#memory_$Pointer$.base| .cse20))) (let ((.cse21 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32))) (.cse22 (select .cse24 (_ bv4 32))) (.cse23 (bvadd .cse18 (_ bv4 32)))) (let ((.cse19 (select (select |#memory_$Pointer$.base| .cse22) .cse23)) (.cse25 (bvadd .cse21 (_ bv4 32)))) (and (= (_ bv0 32) .cse18) (bvult .cse19 |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult .cse20 |#StackHeapBarrier|) (= .cse21 (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| .cse19) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) .cse19)) (not (= .cse20 .cse19)) (= (select (select |#memory_$Pointer$.base| .cse19) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| .cse22) .cse23) (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse22)) (= |ULTIMATE.start_main_~ptr~0#1.base| (select .cse24 .cse25)) (= |ULTIMATE.start_main_~ptr~0#1.offset| (select .cse26 .cse25)) (not (= (_ bv0 32) .cse20)))))))))) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse7 (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (let ((.cse27 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse29 (select |#memory_$Pointer$.base| .cse27))) (let ((.cse28 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (select .cse29 (_ bv4 32)))) (and (not (= .cse27 |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse28) (= .cse28 (_ bv0 32)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse27) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= .cse27 (select .cse29 (bvadd .cse28 (_ bv4 32))))) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse27)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse30)) (= (select (select |#memory_$Pointer$.offset| .cse27) (_ bv4 32)) (_ bv0 32)) (not (= .cse30 |node_create_~temp~0#1.base|)) (= (select (select |#memory_int| .cse30) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 32) .cse27))))))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse33 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse31 (select (select |#memory_$Pointer$.offset| .cse33) (_ bv4 32)))) (let ((.cse34 (select (select |#memory_$Pointer$.base| .cse33) (_ bv4 32))) (.cse35 (bvadd .cse31 (_ bv4 32)))) (let ((.cse36 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32))) (.cse32 (select (select |#memory_$Pointer$.base| .cse34) .cse35))) (and (= (_ bv0 32) .cse31) (bvult .cse32 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse33) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| .cse32) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| .cse34) .cse35) (_ bv0 32)) (= .cse36 (_ bv0 32)) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse36) (not (= .cse33 .cse32)) (not (= .cse34 .cse32)) (bvult .cse34 |#StackHeapBarrier|))))))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_arrayElimIndex_36 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (let ((.cse37 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse38 (select (select |#memory_$Pointer$.base| .cse37) (_ bv4 32)))) (and (not (= (_ bv0 32) v_arrayElimIndex_36)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse37) (not (= .cse38 |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse38 .cse37)) (bvult .cse37 |#StackHeapBarrier|) (bvult v_arrayElimIndex_36 |#StackHeapBarrier|) (not (= .cse37 |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= (_ bv0 32) .cse38)) (not (= (_ bv0 32) .cse37)))))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse41 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse39 (select (select |#memory_$Pointer$.offset| .cse41) (_ bv4 32)))) (let ((.cse43 (select (select |#memory_$Pointer$.base| .cse41) (_ bv4 32))) (.cse44 (bvadd .cse39 (_ bv4 32)))) (let ((.cse42 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32))) (.cse40 (select (select |#memory_$Pointer$.base| .cse43) .cse44))) (and (= (_ bv0 32) .cse39) (bvult .cse40 |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult .cse41 |#StackHeapBarrier|) (= .cse42 (_ bv0 32)) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse42) (= (select (select |#memory_$Pointer$.offset| .cse40) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) .cse40)) (not (= .cse41 .cse40)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse41) (= (select (select |#memory_$Pointer$.base| .cse40) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| .cse43) .cse44) (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse43)) (not (= (_ bv0 32) .cse41))))))))) (and .cse0 (= |ULTIMATE.start_main_~temp~2#1.offset| (_ bv0 32)) .cse2 .cse4 .cse5 .cse7 (= |ULTIMATE.start_main_~count~0#1| (_ bv3 32)) (= |ULTIMATE.start_main_~temp~2#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~ptr~0#1.base| (_ bv0 32))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~count~0#1| (_ bv2 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse49 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse53 (select |#memory_$Pointer$.offset| .cse49))) (let ((.cse45 (select .cse53 (_ bv4 32))) (.cse55 (select |#memory_$Pointer$.base| .cse49)) (.cse50 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse54 (bvadd .cse50 (_ bv4 32))) (.cse51 (select .cse55 (_ bv4 32))) (.cse52 (bvadd .cse45 (_ bv4 32)))) (let ((.cse46 (select (select |#memory_$Pointer$.base| .cse51) .cse52)) (.cse47 (select .cse55 .cse54)) (.cse48 (bvadd (select .cse53 .cse54) (_ bv4 32)))) (and (= (_ bv0 32) .cse45) (bvult .cse46 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| .cse47) .cse48)) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult .cse49 |#StackHeapBarrier|) (= .cse50 (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| .cse46) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) .cse46)) (not (= .cse49 .cse46)) (= (select (select |#memory_$Pointer$.base| .cse46) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| .cse51) .cse52) (_ bv0 32)) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| .cse47) .cse48)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse51)) (not (= (_ bv0 32) .cse49))))))))) .cse5 .cse6 .cse7 .cse17))) [2021-12-17 09:16:25,745 INFO L858 garLoopResultBuilder]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2021-12-17 09:16:25,746 INFO L858 garLoopResultBuilder]: For program point L618-3(lines 611 633) no Hoare annotation was computed. [2021-12-17 09:16:25,746 INFO L854 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse15 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (bvneg (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))) (let ((.cse1 (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32))) (.cse4 (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32))) (.cse8 (bvneg .cse0)) (.cse10 (select .cse15 (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (.cse9 (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|)) (_ bv1 1)))) (.cse11 (bvult |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|)) (.cse5 (= (_ bv0 32) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32))) (.cse12 (not (= (_ bv0 32) |ULTIMATE.start_sll_create_~head~0#1.base|))) (.cse3 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|)) (.cse13 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (_ bv4 32)) (_ bv0 32))) (.cse14 (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|))) (or (and (= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32)) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) .cse1 (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32)) .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse7 (select .cse15 (_ bv4 32)))) (and .cse1 .cse2 .cse4 (= (select (select |#memory_$Pointer$.offset| .cse7) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg .cse8) (_ bv1 1))) (= |ULTIMATE.start_sll_create_~len#1| (_ bv0 32)) .cse9 (bvult .cse10 |#StackHeapBarrier|) .cse11 .cse5 .cse6 (= (select (select |#memory_$Pointer$.base| .cse10) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_int| .cse7) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) .cse12 (not (= (_ bv0 32) .cse10)) .cse3 .cse13 (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| .cse10))) (_ bv1 1))) .cse14)) (and (= |ULTIMATE.start_sll_create_~len#1| (_ bv1 32)) .cse1 .cse2 .cse4 (= (_ bv0 1) (bvadd .cse8 (_ bv1 1))) (= .cse10 (_ bv0 32)) .cse9 .cse11 .cse5 .cse6 .cse12 .cse3 .cse13 .cse14)))) [2021-12-17 09:16:25,746 INFO L858 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2021-12-17 09:16:25,746 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 09:16:25,746 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 09:16:25,746 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 09:16:25,746 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 631) no Hoare annotation was computed. [2021-12-17 09:16:25,746 INFO L854 garLoopResultBuilder]: At program point L627(lines 611 633) the Hoare annotation is: false [2021-12-17 09:16:25,747 INFO L854 garLoopResultBuilder]: At program point L590(lines 583 591) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse2 (select .cse4 (_ bv4 32))) (.cse0 (select .cse3 (bvadd |ULTIMATE.start_sll_create_#res#1.offset| (_ bv4 32)))) (.cse1 (select .cse4 (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))))) (and (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (= (select (select |#memory_$Pointer$.base| .cse0) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_create_#res#1.base|)) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|)) (_ bv1 1))) (bvult .cse1 |#StackHeapBarrier|) (= (_ bv0 32) |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| .cse1) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) |ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (_ bv0 32) .cse1)) (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_int| .cse0) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_create_#res#1.base| |#StackHeapBarrier|) (= (select (select |#memory_int| |ULTIMATE.start_sll_create_#res#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32)) (= (select (select |#memory_$Pointer$.offset| .cse2) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) .cse0)) (not (= (_ bv0 32) |ULTIMATE.start_sll_create_#res#1.base|)) (bvult |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (bvult .cse0 |#StackHeapBarrier|) (= (select (select |#memory_int| .cse2) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| .cse0))) (_ bv1 1))) (= |ULTIMATE.start_sll_create_#res#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| .cse1))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.offset| (select .cse3 (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))) [2021-12-17 09:16:25,747 INFO L854 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse1 (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32))) (.cse4 (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32))) (.cse0 (bvneg (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))) (.cse5 (= (_ bv0 32) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32))) (.cse3 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|))) (or (and (= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32)) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) .cse1 (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32)) .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse7 (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (and (= |ULTIMATE.start_sll_create_~len#1| (_ bv1 32)) .cse1 .cse2 .cse4 (= (_ bv0 1) (bvadd (bvneg .cse0) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse7) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|)) (_ bv1 1))) (bvult |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) .cse5 .cse6 (not (= (_ bv0 32) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse7) (_ bv0 32)) .cse3 (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|))))) [2021-12-17 09:16:25,747 INFO L858 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2021-12-17 09:16:25,747 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 09:16:25,747 INFO L861 garLoopResultBuilder]: At program point L632(lines 611 633) the Hoare annotation is: true [2021-12-17 09:16:25,747 INFO L858 garLoopResultBuilder]: For program point L599(lines 599 610) no Hoare annotation was computed. [2021-12-17 09:16:25,748 INFO L858 garLoopResultBuilder]: For program point L620(lines 620 622) no Hoare annotation was computed. [2021-12-17 09:16:25,748 INFO L854 garLoopResultBuilder]: At program point L600(line 600) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (.cse8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (.cse6 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse1 (select .cse9 (bvadd |ULTIMATE.start_sll_create_#res#1.offset| (_ bv4 32)))) (.cse3 (select (select |#memory_$Pointer$.base| .cse6) (_ bv4 32))) (.cse2 (select (select |#memory_$Pointer$.base| .cse5) (bvadd .cse8 (_ bv4 32)))) (.cse0 (select .cse7 (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (.cse4 (select .cse9 (_ bv4 32)))) (and (= |ULTIMATE.start_sll_append_~head#1.offset| (_ bv0 32)) (= |ULTIMATE.start_sll_append_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| .cse0) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (= (select (select |#memory_$Pointer$.base| .cse1) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_create_#res#1.base|)) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.offset| .cse2) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|)) (_ bv1 1))) (bvult .cse3 |#StackHeapBarrier|) (bvult .cse0 |#StackHeapBarrier|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| .cse4))) (_ bv1 1))) (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| .cse0) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) |ULTIMATE.start_sll_create_~head~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (_ bv0 32) .cse0)) (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 32) .cse3)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| .cse5)) (_ bv1 1))) (= (select (select |#memory_int| .cse1) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 32) .cse6)) (= (select (select |#memory_$Pointer$.base| .cse2) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (bvult |ULTIMATE.start_sll_create_#res#1.base| |#StackHeapBarrier|) (= (select (select |#memory_int| |ULTIMATE.start_sll_create_#res#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32)) (= |ULTIMATE.start_sll_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (_ bv0 32) .cse1)) (not (= (_ bv0 32) |ULTIMATE.start_sll_create_#res#1.base|)) (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= (select (select |#memory_int| .cse6) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (bvult .cse1 |#StackHeapBarrier|) (= (select (select |#memory_int| (select .cse7 (_ bv4 32))) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| .cse6) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_sll_create_#res#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) (_ bv4 32)) (_ bv0 32)) (= .cse8 (_ bv0 32)) (= (select (select |#memory_int| .cse3) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| .cse2))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| .cse0))) (_ bv1 1))) (bvult .cse6 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| .cse4) (_ bv4 32)) (_ bv0 32))))) [2021-12-17 09:16:25,748 INFO L858 garLoopResultBuilder]: For program point L600-1(line 600) no Hoare annotation was computed. [2021-12-17 09:16:25,748 INFO L858 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2021-12-17 09:16:25,748 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2021-12-17 09:16:25,748 INFO L858 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2021-12-17 09:16:25,749 INFO L861 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2021-12-17 09:16:25,749 INFO L854 garLoopResultBuilder]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (or (not (bvult (_ bv0 32) |#StackHeapBarrier|)) (= (_ bv0 32) (bvadd |#StackHeapBarrier| (_ bv1 32))) (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|))) [2021-12-17 09:16:25,749 INFO L858 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2021-12-17 09:16:25,749 INFO L858 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2021-12-17 09:16:25,751 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-17 09:16:25,752 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 09:16:25,758 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 1) (_ BitVec 1)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-17 09:16:25,762 INFO L158 Benchmark]: Toolchain (without parser) took 455461.64ms. Allocated memory was 50.3MB in the beginning and 81.8MB in the end (delta: 31.5MB). Free memory was 26.3MB in the beginning and 49.4MB in the end (delta: -23.1MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2021-12-17 09:16:25,762 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 50.3MB. Free memory was 32.9MB in the beginning and 32.8MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 09:16:25,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.92ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 26.0MB in the beginning and 41.6MB in the end (delta: -15.6MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2021-12-17 09:16:25,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.09ms. Allocated memory is still 67.1MB. Free memory was 41.6MB in the beginning and 39.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:16:25,763 INFO L158 Benchmark]: Boogie Preprocessor took 60.22ms. Allocated memory is still 67.1MB. Free memory was 39.5MB in the beginning and 37.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:16:25,764 INFO L158 Benchmark]: RCFGBuilder took 497.43ms. Allocated memory is still 67.1MB. Free memory was 37.6MB in the beginning and 39.9MB in the end (delta: -2.3MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2021-12-17 09:16:25,764 INFO L158 Benchmark]: TraceAbstraction took 454371.26ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 39.7MB in the beginning and 49.4MB in the end (delta: -9.7MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2021-12-17 09:16:25,770 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 50.3MB. Free memory was 32.9MB in the beginning and 32.8MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.92ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 26.0MB in the beginning and 41.6MB in the end (delta: -15.6MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.09ms. Allocated memory is still 67.1MB. Free memory was 41.6MB in the beginning and 39.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.22ms. Allocated memory is still 67.1MB. Free memory was 39.5MB in the beginning and 37.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 497.43ms. Allocated memory is still 67.1MB. Free memory was 37.6MB in the beginning and 39.9MB in the end (delta: -2.3MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * TraceAbstraction took 454371.26ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 39.7MB in the beginning and 49.4MB in the end (delta: -9.7MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 631]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 454.3s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 81.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 356 mSDsluCounter, 4802 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1779 IncrementalHoareTripleChecker+Unchecked, 4405 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2135 IncrementalHoareTripleChecker+Invalid, 4020 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 397 mSDtfsCounter, 2135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1677 GetRequests, 868 SyntacticMatches, 40 SemanticMatches, 769 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 14030 ImplicationChecksByTransitivity, 356.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=16, InterpolantAutomatonStates: 283, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 56 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 27 PreInvPairs, 42 NumberOfFragments, 3243 HoareAnnotationTreeSize, 27 FomulaSimplifications, 57 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 6736 FormulaSimplificationTreeSizeReductionInter, 11.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 347.7s InterpolantComputationTime, 1136 NumberOfCodeBlocks, 1096 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1227 ConstructedInterpolants, 313 QuantifiedInterpolants, 38403 SizeOfPredicates, 655 NumberOfNonLiveVariables, 6129 ConjunctsInSsa, 1515 ConjunctsInUnsatCore, 32 InterpolantComputations, 5 PerfectInterpolantSequences, 412/774 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 0 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 1) (_ BitVec 1)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 1) (_ BitVec 1)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-17 09:16:25,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 1) (_ BitVec 1)) not yet implemented, please contact Matthias