./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_unequal.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_unequal.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 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 09:07:00,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 09:07:00,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 09:07:00,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 09:07:00,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 09:07:00,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 09:07:00,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 09:07:00,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 09:07:00,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 09:07:00,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 09:07:00,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 09:07:00,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 09:07:00,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 09:07:00,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 09:07:00,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 09:07:00,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 09:07:00,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 09:07:00,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 09:07:00,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 09:07:00,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 09:07:00,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 09:07:00,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 09:07:00,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 09:07:00,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 09:07:00,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 09:07:00,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 09:07:00,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 09:07:00,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 09:07:00,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 09:07:00,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 09:07:00,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 09:07:00,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 09:07:00,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 09:07:00,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 09:07:00,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 09:07:00,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 09:07:00,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 09:07:00,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 09:07:00,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 09:07:00,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 09:07:00,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 09:07:00,164 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:07:00,199 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 09:07:00,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 09:07:00,200 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 09:07:00,200 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 09:07:00,201 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 09:07:00,201 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 09:07:00,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 09:07:00,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 09:07:00,202 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 09:07:00,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 09:07:00,203 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 09:07:00,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 09:07:00,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 09:07:00,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 09:07:00,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 09:07:00,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 09:07:00,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 09:07:00,205 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 09:07:00,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 09:07:00,205 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 09:07:00,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 09:07:00,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 09:07:00,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 09:07:00,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 09:07:00,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:07:00,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 09:07:00,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 09:07:00,207 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 09:07:00,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 09:07:00,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 09:07:00,209 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 09:07:00,209 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 09:07:00,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 09:07:00,209 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 09:07:00,210 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2021-12-17 09:07:00,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 09:07:00,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 09:07:00,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 09:07:00,472 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 09:07:00,472 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 09:07:00,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2021-12-17 09:07:00,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ab87aba/eb1d89bb88064e38b14642f7ba76708d/FLAG4c65b05c4 [2021-12-17 09:07:01,023 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 09:07:01,023 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2021-12-17 09:07:01,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ab87aba/eb1d89bb88064e38b14642f7ba76708d/FLAG4c65b05c4 [2021-12-17 09:07:01,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ab87aba/eb1d89bb88064e38b14642f7ba76708d [2021-12-17 09:07:01,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 09:07:01,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 09:07:01,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 09:07:01,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 09:07:01,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 09:07:01,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:07:01" (1/1) ... [2021-12-17 09:07:01,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@351202b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:01, skipping insertion in model container [2021-12-17 09:07:01,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:07:01" (1/1) ... [2021-12-17 09:07:01,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 09:07:01,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 09:07:01,842 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_unequal.i[24323,24336] [2021-12-17 09:07:01,852 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:07:01,860 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 09:07:01,911 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_unequal.i[24323,24336] [2021-12-17 09:07:01,918 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:07:01,941 INFO L208 MainTranslator]: Completed translation [2021-12-17 09:07:01,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:01 WrapperNode [2021-12-17 09:07:01,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 09:07:01,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 09:07:01,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 09:07:01,943 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 09:07:01,948 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:07:01" (1/1) ... [2021-12-17 09:07:01,974 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:07:01" (1/1) ... [2021-12-17 09:07:01,999 INFO L137 Inliner]: procedures = 127, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 134 [2021-12-17 09:07:02,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 09:07:02,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 09:07:02,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 09:07:02,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 09:07:02,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:01" (1/1) ... [2021-12-17 09:07:02,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:01" (1/1) ... [2021-12-17 09:07:02,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:01" (1/1) ... [2021-12-17 09:07:02,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:01" (1/1) ... [2021-12-17 09:07:02,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:01" (1/1) ... [2021-12-17 09:07:02,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:01" (1/1) ... [2021-12-17 09:07:02,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:01" (1/1) ... [2021-12-17 09:07:02,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 09:07:02,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 09:07:02,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 09:07:02,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 09:07:02,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:01" (1/1) ... [2021-12-17 09:07:02,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:07:02,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:07:02,093 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:07:02,115 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:07:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 09:07:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 09:07:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-17 09:07:02,135 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-17 09:07:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 09:07:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 09:07:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 09:07:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 09:07:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 09:07:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 09:07:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 09:07:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 09:07:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 09:07:02,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 09:07:02,261 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 09:07:02,267 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 09:07:02,512 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 09:07:02,520 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 09:07:02,522 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-17 09:07:02,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:07:02 BoogieIcfgContainer [2021-12-17 09:07:02,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 09:07:02,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 09:07:02,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 09:07:02,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 09:07:02,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:07:01" (1/3) ... [2021-12-17 09:07:02,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533706ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:07:02, skipping insertion in model container [2021-12-17 09:07:02,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:01" (2/3) ... [2021-12-17 09:07:02,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533706ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:07:02, skipping insertion in model container [2021-12-17 09:07:02,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:07:02" (3/3) ... [2021-12-17 09:07:02,539 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2021-12-17 09:07:02,543 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 09:07:02,543 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 09:07:02,595 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 09:07:02,602 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:07:02,602 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 09:07:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 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:07:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 09:07:02,627 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:07:02,628 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:07:02,628 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:07:02,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:07:02,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1473722618, now seen corresponding path program 1 times [2021-12-17 09:07:02,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:07:02,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220440308] [2021-12-17 09:07:02,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:02,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:07:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:02,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 09:07:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:02,840 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:07:02,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:07:02,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220440308] [2021-12-17 09:07:02,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220440308] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:07:02,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:07:02,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 09:07:02,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921335405] [2021-12-17 09:07:02,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:07:02,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 09:07:02,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:07:02,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 09:07:02,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 09:07:02,873 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 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:07:02,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:07:02,944 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2021-12-17 09:07:02,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 09:07:02,947 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:07:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:07:02,958 INFO L225 Difference]: With dead ends: 64 [2021-12-17 09:07:02,960 INFO L226 Difference]: Without dead ends: 29 [2021-12-17 09:07:02,964 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:07:02,967 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:07:02,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:07:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-17 09:07:03,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-17 09:07:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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:07:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-12-17 09:07:03,007 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 17 [2021-12-17 09:07:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:07:03,008 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-12-17 09:07:03,008 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:07:03,009 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2021-12-17 09:07:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 09:07:03,010 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:07:03,010 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:07:03,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 09:07:03,011 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:07:03,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:07:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1996757262, now seen corresponding path program 1 times [2021-12-17 09:07:03,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:07:03,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259164431] [2021-12-17 09:07:03,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:03,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:07:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:03,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 09:07:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:03,135 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:07:03,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:07:03,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259164431] [2021-12-17 09:07:03,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259164431] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:07:03,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:07:03,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 09:07:03,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36571355] [2021-12-17 09:07:03,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:07:03,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 09:07:03,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:07:03,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 09:07:03,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 09:07:03,142 INFO L87 Difference]: Start difference. First operand 29 states and 36 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:07:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:07:03,196 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2021-12-17 09:07:03,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 09:07:03,197 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:07:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:07:03,198 INFO L225 Difference]: With dead ends: 56 [2021-12-17 09:07:03,199 INFO L226 Difference]: Without dead ends: 33 [2021-12-17 09:07:03,202 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:07:03,206 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:07:03,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:07:03,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-17 09:07:03,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2021-12-17 09:07:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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:07:03,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-12-17 09:07:03,221 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 17 [2021-12-17 09:07:03,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:07:03,221 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-17 09:07:03,225 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:07:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2021-12-17 09:07:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 09:07:03,227 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:07:03,227 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:07:03,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 09:07:03,227 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:07:03,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:07:03,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1017886446, now seen corresponding path program 1 times [2021-12-17 09:07:03,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:07:03,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459306009] [2021-12-17 09:07:03,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:03,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:07:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:03,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:07:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:03,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 09:07:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:03,360 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:07:03,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:07:03,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459306009] [2021-12-17 09:07:03,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459306009] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:03,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436673429] [2021-12-17 09:07:03,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:03,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:03,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:07:03,371 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:07:03,403 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:07:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:03,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 09:07:03,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:07:03,605 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:07:03,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:07:03,665 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:07:03,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436673429] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:07:03,665 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:07:03,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2021-12-17 09:07:03,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814691682] [2021-12-17 09:07:03,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:07:03,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 09:07:03,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:07:03,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 09:07:03,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 09:07:03,668 INFO L87 Difference]: Start difference. First operand 30 states and 37 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:07:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:07:03,712 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2021-12-17 09:07:03,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 09:07:03,712 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:07:03,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:07:03,714 INFO L225 Difference]: With dead ends: 57 [2021-12-17 09:07:03,714 INFO L226 Difference]: Without dead ends: 34 [2021-12-17 09:07:03,715 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:07:03,717 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:07:03,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 140 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:07:03,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-17 09:07:03,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-17 09:07:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 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:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2021-12-17 09:07:03,726 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 26 [2021-12-17 09:07:03,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:07:03,726 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2021-12-17 09:07:03,727 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:07:03,727 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2021-12-17 09:07:03,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 09:07:03,728 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:07:03,728 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:07:03,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 09:07:03,951 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:07:03,952 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:07:03,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:07:03,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1383615218, now seen corresponding path program 2 times [2021-12-17 09:07:03,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:07:03,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176908819] [2021-12-17 09:07:03,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:03,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:07:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:04,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:07:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:04,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:07:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:04,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:07:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:04,257 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:07:04,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:07:04,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176908819] [2021-12-17 09:07:04,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176908819] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:04,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503827215] [2021-12-17 09:07:04,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:07:04,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:04,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:07:04,260 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:07:04,261 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:07:04,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:07:04,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:07:04,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-17 09:07:04,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:07:04,698 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:07:04,754 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_313 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_313))))) is different from true [2021-12-17 09:07:04,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:04,827 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:07:04,858 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:07:04,897 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:07:04,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:07:04,979 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_316 (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_316) |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|) (<= (+ .cse0 1) 0) (<= 1 .cse0)))) is different from false [2021-12-17 09:07:04,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503827215] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:04,981 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:07:04,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2021-12-17 09:07:04,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915089242] [2021-12-17 09:07:04,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:07:04,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-17 09:07:04,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:07:04,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-17 09:07:04,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=439, Unknown=2, NotChecked=86, Total=600 [2021-12-17 09:07:04,984 INFO L87 Difference]: Start difference. First operand 34 states and 42 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:07:05,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:07:05,263 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2021-12-17 09:07:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 09:07:05,263 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:07:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:07:05,264 INFO L225 Difference]: With dead ends: 44 [2021-12-17 09:07:05,264 INFO L226 Difference]: Without dead ends: 34 [2021-12-17 09:07:05,265 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:07:05,266 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:07:05,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 232 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 158 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2021-12-17 09:07:05,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-17 09:07:05,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-17 09:07:05,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 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:07:05,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-12-17 09:07:05,271 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 35 [2021-12-17 09:07:05,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:07:05,271 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-12-17 09:07:05,272 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:07:05,272 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2021-12-17 09:07:05,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 09:07:05,272 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:07:05,273 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:05,300 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:07:05,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-17 09:07:05,500 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:07:05,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:07:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1699814766, now seen corresponding path program 1 times [2021-12-17 09:07:05,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:07:05,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134633386] [2021-12-17 09:07:05,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:05,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:07:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:05,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:07:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:05,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:07:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:07:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:07:06,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:07:06,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134633386] [2021-12-17 09:07:06,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134633386] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:06,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764229246] [2021-12-17 09:07:06,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:06,001 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:06,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:07:06,004 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:07:06,007 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:07:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:06,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-17 09:07:06,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:07:06,238 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:06,374 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:07:06,571 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-12-17 09:07:06,572 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 43 treesize of output 20 [2021-12-17 09:07:06,578 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:06,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:06,819 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:07:06,819 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 51 treesize of output 53 [2021-12-17 09:07:06,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:06,841 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 25 treesize of output 27 [2021-12-17 09:07:06,849 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 09:07:06,850 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 15 treesize of output 15 [2021-12-17 09:07:07,037 INFO L354 Elim1Store]: treesize reduction 102, result has 30.6 percent of original size [2021-12-17 09:07:07,038 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 58 treesize of output 73 [2021-12-17 09:07:07,059 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-17 09:07:07,060 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 49 treesize of output 44 [2021-12-17 09:07:07,091 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-12-17 09:07:07,092 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 53 treesize of output 20 [2021-12-17 09:07:07,129 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:07:07,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:07:16,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764229246] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:16,882 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:07:16,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 32 [2021-12-17 09:07:16,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358197076] [2021-12-17 09:07:16,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:07:16,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-17 09:07:16,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:07:16,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-17 09:07:16,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1211, Unknown=8, NotChecked=0, Total=1332 [2021-12-17 09:07:16,884 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 32 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-17 09:07:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:07:18,481 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2021-12-17 09:07:18,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-17 09:07:18,485 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2021-12-17 09:07:18,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:07:18,487 INFO L225 Difference]: With dead ends: 48 [2021-12-17 09:07:18,487 INFO L226 Difference]: Without dead ends: 37 [2021-12-17 09:07:18,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=230, Invalid=2210, Unknown=10, NotChecked=0, Total=2450 [2021-12-17 09:07:18,488 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 34 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:07:18,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 339 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 323 Invalid, 0 Unknown, 25 Unchecked, 0.2s Time] [2021-12-17 09:07:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-17 09:07:18,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2021-12-17 09:07:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 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:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2021-12-17 09:07:18,494 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 38 [2021-12-17 09:07:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:07:18,494 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2021-12-17 09:07:18,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-17 09:07:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2021-12-17 09:07:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 09:07:18,500 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:07:18,501 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:18,532 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:18,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:18,724 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:07:18,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:07:18,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1006966459, now seen corresponding path program 1 times [2021-12-17 09:07:18,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:07:18,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690985928] [2021-12-17 09:07:18,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:18,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:07:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:19,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:07:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:19,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:07:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:19,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:07:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:07:19,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:07:19,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690985928] [2021-12-17 09:07:19,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690985928] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:19,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987392284] [2021-12-17 09:07:19,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:19,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:19,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:07:19,878 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:19,878 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:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:20,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 118 conjunts are in the unsatisfiable core [2021-12-17 09:07:20,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:07:20,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, 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:20,464 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:20,586 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 09:07:20,586 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 17 treesize of output 21 [2021-12-17 09:07:20,669 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:07:20,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:20,677 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:21,030 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:07:21,031 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 65 treesize of output 32 [2021-12-17 09:07:21,039 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:21,047 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:07:21,052 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 11 treesize of output 7 [2021-12-17 09:07:21,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:21,340 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:07:21,340 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 73 treesize of output 65 [2021-12-17 09:07:21,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:21,350 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:07:21,368 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:07:21,368 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 28 treesize of output 30 [2021-12-17 09:07:21,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:21,375 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:22,003 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:07:22,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:22,038 INFO L354 Elim1Store]: treesize reduction 152, result has 16.0 percent of original size [2021-12-17 09:07:22,039 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 170 treesize of output 86 [2021-12-17 09:07:22,057 INFO L354 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2021-12-17 09:07:22,057 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 37 treesize of output 28 [2021-12-17 09:07:22,064 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 26 treesize of output 28 [2021-12-17 09:07:22,156 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:07:22,156 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 52 treesize of output 27 [2021-12-17 09:07:22,160 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:22,233 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:07:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:07:22,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:07:22,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_643 Int) (v_ArrVal_640 (Array Int Int)) (v_ArrVal_644 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_640) (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_644)) |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_643)) |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:22,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987392284] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:22,915 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:07:22,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2021-12-17 09:07:22,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086738231] [2021-12-17 09:07:22,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:07:22,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-17 09:07:22,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:07:22,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-17 09:07:22,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2681, Unknown=7, NotChecked=104, Total=2970 [2021-12-17 09:07:22,918 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 49 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 41 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:07:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:07:24,752 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2021-12-17 09:07:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 09:07:24,753 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 41 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:07:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:07:24,754 INFO L225 Difference]: With dead ends: 60 [2021-12-17 09:07:24,754 INFO L226 Difference]: Without dead ends: 58 [2021-12-17 09:07:24,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=390, Invalid=4718, Unknown=8, NotChecked=140, Total=5256 [2021-12-17 09:07:24,756 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 126 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:07:24,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 425 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 729 Invalid, 0 Unknown, 32 Unchecked, 0.4s Time] [2021-12-17 09:07:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-17 09:07:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2021-12-17 09:07:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 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:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2021-12-17 09:07:24,762 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 42 [2021-12-17 09:07:24,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:07:24,763 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-12-17 09:07:24,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 41 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:07:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2021-12-17 09:07:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-17 09:07:24,768 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:07:24,768 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, 1] [2021-12-17 09:07:24,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-17 09:07:24,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:24,969 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:07:24,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:07:24,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1151243655, now seen corresponding path program 1 times [2021-12-17 09:07:24,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:07:24,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362454969] [2021-12-17 09:07:24,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:24,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:07:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:25,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:07:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:25,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:07:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:25,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:07:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:25,075 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-17 09:07:25,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:07:25,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362454969] [2021-12-17 09:07:25,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362454969] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:07:25,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:07:25,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 09:07:25,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810960628] [2021-12-17 09:07:25,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:07:25,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 09:07:25,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:07:25,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 09:07:25,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 09:07:25,078 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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:07:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:07:25,134 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2021-12-17 09:07:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 09:07:25,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 43 [2021-12-17 09:07:25,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:07:25,138 INFO L225 Difference]: With dead ends: 54 [2021-12-17 09:07:25,138 INFO L226 Difference]: Without dead ends: 49 [2021-12-17 09:07:25,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 09:07:25,140 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:07:25,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 110 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:07:25,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-17 09:07:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2021-12-17 09:07:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 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:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2021-12-17 09:07:25,148 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 43 [2021-12-17 09:07:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:07:25,149 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2021-12-17 09:07:25,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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:07:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2021-12-17 09:07:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 09:07:25,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:07:25,150 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, 1, 1] [2021-12-17 09:07:25,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 09:07:25,150 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:07:25,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:07:25,151 INFO L85 PathProgramCache]: Analyzing trace with hash 223363488, now seen corresponding path program 2 times [2021-12-17 09:07:25,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:07:25,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707184993] [2021-12-17 09:07:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:25,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:07:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:25,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:07:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:26,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:07:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:26,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:07:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:07:26,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:07:26,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707184993] [2021-12-17 09:07:26,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707184993] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:26,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006099974] [2021-12-17 09:07:26,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:07:26,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:26,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:07:26,445 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:26,446 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:26,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:07:26,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:07:26,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 111 conjunts are in the unsatisfiable core [2021-12-17 09:07:26,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:07:26,676 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:26,762 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:07:26,765 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:07:27,022 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 09:07:27,023 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:27,031 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:07:27,038 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:07:27,102 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:27,105 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:07:27,407 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-17 09:07:27,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 5 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 44 [2021-12-17 09:07:27,420 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-17 09:07:27,421 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 2 case distinctions, treesize of input 21 treesize of output 21 [2021-12-17 09:07:27,426 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:27,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:27,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:27,628 INFO L354 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2021-12-17 09:07:27,628 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 107 treesize of output 110 [2021-12-17 09:07:27,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:27,645 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-17 09:07:27,645 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 116 treesize of output 106 [2021-12-17 09:07:27,670 INFO L354 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2021-12-17 09:07:27,671 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 34 treesize of output 36 [2021-12-17 09:07:27,938 INFO L354 Elim1Store]: treesize reduction 72, result has 4.0 percent of original size [2021-12-17 09:07:27,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 74 [2021-12-17 09:07:27,954 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-12-17 09:07:27,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 32 [2021-12-17 09:07:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:07:28,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:07:28,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006099974] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:28,412 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:07:28,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20] total 43 [2021-12-17 09:07:28,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698669561] [2021-12-17 09:07:28,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:07:28,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-17 09:07:28,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:07:28,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-17 09:07:28,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=2036, Unknown=6, NotChecked=0, Total=2162 [2021-12-17 09:07:28,415 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 43 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 36 states have internal predecessors, (71), 6 states have call successors, (6), 3 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:07:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:07:30,833 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2021-12-17 09:07:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-17 09:07:30,834 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 36 states have internal predecessors, (71), 6 states have call successors, (6), 3 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:07:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:07:30,835 INFO L225 Difference]: With dead ends: 91 [2021-12-17 09:07:30,835 INFO L226 Difference]: Without dead ends: 76 [2021-12-17 09:07:30,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=335, Invalid=4770, Unknown=7, NotChecked=0, Total=5112 [2021-12-17 09:07:30,837 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:07:30,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 503 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 657 Invalid, 0 Unknown, 124 Unchecked, 0.4s Time] [2021-12-17 09:07:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-17 09:07:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2021-12-17 09:07:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 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:07:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2021-12-17 09:07:30,855 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 44 [2021-12-17 09:07:30,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:07:30,855 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2021-12-17 09:07:30,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 36 states have internal predecessors, (71), 6 states have call successors, (6), 3 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:07:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2021-12-17 09:07:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-17 09:07:30,858 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:07:30,858 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, 1] [2021-12-17 09:07:30,887 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:31,086 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:31,086 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:07:31,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:07:31,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1809434049, now seen corresponding path program 1 times [2021-12-17 09:07:31,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:07:31,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571223858] [2021-12-17 09:07:31,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:31,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:07:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:31,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:07:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:31,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:07:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:31,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:07:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:07:32,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:07:32,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571223858] [2021-12-17 09:07:32,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571223858] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:07:32,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528065815] [2021-12-17 09:07:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:07:32,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:07:32,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:07:32,064 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:32,073 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:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:07:32,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 162 conjunts are in the unsatisfiable core [2021-12-17 09:07:32,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:07:32,222 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:32,282 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:32,379 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:32,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:32,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-17 09:07:32,538 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:32,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 13 treesize of output 9 [2021-12-17 09:07:32,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:32,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 21 treesize of output 20 [2021-12-17 09:07:32,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:32,659 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 11 treesize of output 7 [2021-12-17 09:07:32,664 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:32,668 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:32,671 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:32,898 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 09:07:32,898 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 16 treesize of output 22 [2021-12-17 09:07:32,906 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:07:32,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:32,933 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-17 09:07:32,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-17 09:07:32,950 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 16 treesize of output 18 [2021-12-17 09:07:32,955 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:07:33,057 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 21 treesize of output 20 [2021-12-17 09:07:33,061 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 20 treesize of output 22 [2021-12-17 09:07:33,066 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 27 treesize of output 26 [2021-12-17 09:07:33,467 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-17 09:07:33,467 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 182 treesize of output 66 [2021-12-17 09:07:33,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:33,474 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 0 case distinctions, treesize of input 21 treesize of output 12 [2021-12-17 09:07:33,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:33,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 16 treesize of output 10 [2021-12-17 09:07:33,483 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:33,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:33,693 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-17 09:07:33,693 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 190 treesize of output 158 [2021-12-17 09:07:33,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:33,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:33,707 INFO L354 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2021-12-17 09:07:33,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 162 [2021-12-17 09:07:33,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:33,718 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 28 treesize of output 30 [2021-12-17 09:07:33,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:33,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:33,736 INFO L354 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2021-12-17 09:07:33,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2021-12-17 09:07:34,398 INFO L354 Elim1Store]: treesize reduction 190, result has 15.9 percent of original size [2021-12-17 09:07:34,399 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 204 treesize of output 113 [2021-12-17 09:07:34,462 INFO L354 Elim1Store]: treesize reduction 116, result has 22.7 percent of original size [2021-12-17 09:07:34,462 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 5 case distinctions, treesize of input 199 treesize of output 186 [2021-12-17 09:07:34,482 INFO L354 Elim1Store]: treesize reduction 47, result has 48.9 percent of original size [2021-12-17 09:07:34,483 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 35 treesize of output 58 [2021-12-17 09:07:50,154 INFO L354 Elim1Store]: treesize reduction 121, result has 24.8 percent of original size [2021-12-17 09:07:50,154 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 326 treesize of output 159 [2021-12-17 09:07:50,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:07:50,178 INFO L354 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2021-12-17 09:07:50,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 38 [2021-12-17 09:07:50,406 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 32 treesize of output 24 [2021-12-17 09:07:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 09:07:50,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:08:12,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528065815] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:12,654 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:08:12,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 50 [2021-12-17 09:08:12,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132973550] [2021-12-17 09:08:12,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:08:12,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-17 09:08:12,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:08:12,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-17 09:08:12,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3349, Unknown=9, NotChecked=0, Total=3540 [2021-12-17 09:08:12,656 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 50 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 42 states have internal predecessors, (76), 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:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:15,255 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2021-12-17 09:08:15,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 09:08:15,255 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 42 states have internal predecessors, (76), 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 45 [2021-12-17 09:08:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:15,256 INFO L225 Difference]: With dead ends: 78 [2021-12-17 09:08:15,257 INFO L226 Difference]: Without dead ends: 76 [2021-12-17 09:08:15,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=340, Invalid=5657, Unknown=9, NotChecked=0, Total=6006 [2021-12-17 09:08:15,259 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:08:15,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 468 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 721 Invalid, 0 Unknown, 176 Unchecked, 0.4s Time] [2021-12-17 09:08:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-17 09:08:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2021-12-17 09:08:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 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:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2021-12-17 09:08:15,268 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 45 [2021-12-17 09:08:15,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:15,268 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2021-12-17 09:08:15,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 42 states have internal predecessors, (76), 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:15,269 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2021-12-17 09:08:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-17 09:08:15,270 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:15,270 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, 1, 1, 1, 1] [2021-12-17 09:08:15,292 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:08:15,491 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:08:15,491 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:15,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash 257826173, now seen corresponding path program 1 times [2021-12-17 09:08:15,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:08:15,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745984416] [2021-12-17 09:08:15,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:15,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:08:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:15,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:08:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:08:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:16,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:08:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 09:08:16,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:08:16,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745984416] [2021-12-17 09:08:16,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745984416] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:16,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131985002] [2021-12-17 09:08:16,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:16,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:08:16,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:08:16,232 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:08:16,255 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:08:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:16,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 137 conjunts are in the unsatisfiable core [2021-12-17 09:08:16,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:16,533 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:16,737 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:08:16,884 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 09:08:16,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-17 09:08:16,978 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:16,992 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:17,262 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:08:17,263 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 72 treesize of output 35 [2021-12-17 09:08:17,273 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 09:08:17,273 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 1 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 09:08:17,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:17,279 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 15 treesize of output 7 [2021-12-17 09:08:17,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:17,455 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:08:17,455 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 82 treesize of output 70 [2021-12-17 09:08:17,473 INFO L354 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2021-12-17 09:08:17,473 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 3 case distinctions, treesize of input 28 treesize of output 30 [2021-12-17 09:08:17,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:17,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:17,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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:08:18,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:08:18,168 INFO L354 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2021-12-17 09:08:18,168 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 221 treesize of output 105 [2021-12-17 09:08:18,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:18,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:18,188 INFO L354 Elim1Store]: treesize reduction 120, result has 11.1 percent of original size [2021-12-17 09:08:18,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 138 [2021-12-17 09:08:18,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:18,531 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-17 09:08:18,532 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 170 treesize of output 116 [2021-12-17 09:08:18,710 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 09:08:18,710 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 135 treesize of output 49 [2021-12-17 09:08:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:08:18,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:08:25,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131985002] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:25,520 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:08:25,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 49 [2021-12-17 09:08:25,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319710031] [2021-12-17 09:08:25,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:08:25,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-17 09:08:25,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:08:25,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-17 09:08:25,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=3353, Unknown=6, NotChecked=0, Total=3540 [2021-12-17 09:08:25,522 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 49 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 40 states have internal predecessors, (71), 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:08:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:27,526 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2021-12-17 09:08:27,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 09:08:27,527 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 40 states have internal predecessors, (71), 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 46 [2021-12-17 09:08:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:27,528 INFO L225 Difference]: With dead ends: 82 [2021-12-17 09:08:27,528 INFO L226 Difference]: Without dead ends: 77 [2021-12-17 09:08:27,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=359, Invalid=5487, Unknown=6, NotChecked=0, Total=5852 [2021-12-17 09:08:27,530 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:08:27,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 612 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 640 Invalid, 0 Unknown, 53 Unchecked, 0.4s Time] [2021-12-17 09:08:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-17 09:08:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2021-12-17 09:08:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.121212121212121) internal successors, (74), 66 states have internal predecessors, (74), 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:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2021-12-17 09:08:27,541 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 46 [2021-12-17 09:08:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:27,542 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2021-12-17 09:08:27,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 40 states have internal predecessors, (71), 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:08:27,542 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2021-12-17 09:08:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-17 09:08:27,547 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:27,547 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1] [2021-12-17 09:08:27,572 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:27,747 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:27,748 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:27,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:27,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1284126779, now seen corresponding path program 2 times [2021-12-17 09:08:27,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:08:27,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142004270] [2021-12-17 09:08:27,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:27,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:08:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:28,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:08:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:28,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:08:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:28,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:08:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 09:08:28,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:08:28,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142004270] [2021-12-17 09:08:28,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142004270] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:28,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963977218] [2021-12-17 09:08:28,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:08:28,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:08:28,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:08:28,755 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:28,755 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:28,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:08:28,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:08:28,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 171 conjunts are in the unsatisfiable core [2021-12-17 09:08:28,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:28,940 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:28,989 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:29,117 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 09:08:29,117 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:29,237 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:29,372 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-17 09:08:29,372 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:29,451 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:29,462 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:29,755 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:08:29,755 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 78 treesize of output 37 [2021-12-17 09:08:29,759 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:08:29,763 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:31,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:31,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:31,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:31,194 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 33 treesize of output 39 [2021-12-17 09:08:31,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:31,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:31,207 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 09:08:31,207 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 92 treesize of output 65 [2021-12-17 09:08:31,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:31,224 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:08:31,224 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 33 treesize of output 33 [2021-12-17 09:08:31,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:31,957 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:08:31,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:31,988 INFO L354 Elim1Store]: treesize reduction 191, result has 14.0 percent of original size [2021-12-17 09:08:31,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 214 treesize of output 115 [2021-12-17 09:08:32,016 INFO L354 Elim1Store]: treesize reduction 164, result has 15.0 percent of original size [2021-12-17 09:08:32,016 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 307 treesize of output 199 [2021-12-17 09:08:33,035 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:08:33,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:33,066 INFO L354 Elim1Store]: treesize reduction 174, result has 7.4 percent of original size [2021-12-17 09:08:33,066 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 14 new quantified variables, introduced 21 case distinctions, treesize of input 308 treesize of output 142 [2021-12-17 09:08:33,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:33,086 INFO L354 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2021-12-17 09:08:33,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 40 [2021-12-17 09:08:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:08:33,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:08:34,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963977218] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:34,372 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:08:34,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 55 [2021-12-17 09:08:34,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889195971] [2021-12-17 09:08:34,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:08:34,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-17 09:08:34,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:08:34,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-17 09:08:34,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4351, Unknown=0, NotChecked=0, Total=4556 [2021-12-17 09:08:34,375 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 55 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 46 states have internal predecessors, (77), 6 states have call successors, (6), 3 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:08:39,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:39,571 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2021-12-17 09:08:39,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-17 09:08:39,572 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 46 states have internal predecessors, (77), 6 states have call successors, (6), 3 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 48 [2021-12-17 09:08:39,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:39,572 INFO L225 Difference]: With dead ends: 91 [2021-12-17 09:08:39,572 INFO L226 Difference]: Without dead ends: 83 [2021-12-17 09:08:39,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=339, Invalid=6141, Unknown=0, NotChecked=0, Total=6480 [2021-12-17 09:08:39,574 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:08:39,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 592 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 631 Invalid, 0 Unknown, 80 Unchecked, 0.3s Time] [2021-12-17 09:08:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-17 09:08:39,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2021-12-17 09:08:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 74 states have internal predecessors, (83), 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:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2021-12-17 09:08:39,586 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 48 [2021-12-17 09:08:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:39,586 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2021-12-17 09:08:39,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 46 states have internal predecessors, (77), 6 states have call successors, (6), 3 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:08:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2021-12-17 09:08:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-17 09:08:39,587 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:39,587 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2021-12-17 09:08:39,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-17 09:08:39,791 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:39,792 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:39,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:39,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1153278983, now seen corresponding path program 2 times [2021-12-17 09:08:39,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:08:39,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394094618] [2021-12-17 09:08:39,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:39,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:08:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:40,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 09:08:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:40,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 09:08:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:40,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 09:08:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 09:08:40,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:08:40,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394094618] [2021-12-17 09:08:40,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394094618] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:40,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855348384] [2021-12-17 09:08:40,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:08:40,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:08:40,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:08:40,752 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:40,760 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:40,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:08:40,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:08:40,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 178 conjunts are in the unsatisfiable core [2021-12-17 09:08:40,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:40,960 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:41,001 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:41,125 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: line 1008537 column 46: unknown constant v_#valid_BEFORE_CALL_28 [2021-12-17 09:08:41,125 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 09:08:41,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2021-12-17 09:08:41,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174180631] [2021-12-17 09:08:41,126 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 09:08:41,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-17 09:08:41,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:08:41,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-17 09:08:41,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=865, Unknown=0, NotChecked=0, Total=930 [2021-12-17 09:08:41,127 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 29 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 25 states have internal predecessors, (43), 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:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 09:08:41,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=865, Unknown=0, NotChecked=0, Total=930 [2021-12-17 09:08:41,128 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:41,129 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:41,155 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:41,343 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:41,344 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@55ec007 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:41,347 INFO L158 Benchmark]: Toolchain (without parser) took 99798.17ms. Allocated memory was 92.3MB in the beginning and 224.4MB in the end (delta: 132.1MB). Free memory was 61.7MB in the beginning and 166.1MB in the end (delta: -104.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-12-17 09:08:41,347 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 92.3MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 09:08:41,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.13ms. Allocated memory is still 92.3MB. Free memory was 61.4MB in the beginning and 60.1MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 09:08:41,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.67ms. Allocated memory is still 92.3MB. Free memory was 60.1MB in the beginning and 57.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:08:41,348 INFO L158 Benchmark]: Boogie Preprocessor took 51.97ms. Allocated memory is still 92.3MB. Free memory was 57.9MB in the beginning and 56.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:08:41,348 INFO L158 Benchmark]: RCFGBuilder took 470.02ms. Allocated memory was 92.3MB in the beginning and 123.7MB in the end (delta: 31.5MB). Free memory was 56.2MB in the beginning and 98.5MB in the end (delta: -42.3MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2021-12-17 09:08:41,348 INFO L158 Benchmark]: TraceAbstraction took 98813.58ms. Allocated memory was 123.7MB in the beginning and 224.4MB in the end (delta: 100.7MB). Free memory was 99.7MB in the beginning and 166.1MB in the end (delta: -66.4MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2021-12-17 09:08:41,349 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.20ms. Allocated memory is still 92.3MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.13ms. Allocated memory is still 92.3MB. Free memory was 61.4MB in the beginning and 60.1MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.67ms. Allocated memory is still 92.3MB. Free memory was 60.1MB in the beginning and 57.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.97ms. Allocated memory is still 92.3MB. Free memory was 57.9MB in the beginning and 56.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 470.02ms. Allocated memory was 92.3MB in the beginning and 123.7MB in the end (delta: 31.5MB). Free memory was 56.2MB in the beginning and 98.5MB in the end (delta: -42.3MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * TraceAbstraction took 98813.58ms. Allocated memory was 123.7MB in the beginning and 224.4MB in the end (delta: 100.7MB). Free memory was 99.7MB in the beginning and 166.1MB in the end (delta: -66.4MB). Peak memory consumption was 33.2MB. 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@55ec007 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@55ec007: 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:41,435 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 1 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_unequal.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 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 09:08:43,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 09:08:43,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 09:08:43,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 09:08:43,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 09:08:43,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 09:08:43,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 09:08:43,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 09:08:43,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 09:08:43,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 09:08:43,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 09:08:43,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 09:08:43,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 09:08:43,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 09:08:43,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 09:08:43,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 09:08:43,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 09:08:43,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 09:08:43,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 09:08:43,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 09:08:43,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 09:08:43,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 09:08:43,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 09:08:43,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 09:08:43,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 09:08:43,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 09:08:43,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 09:08:43,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 09:08:43,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 09:08:43,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 09:08:43,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 09:08:43,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 09:08:43,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 09:08:43,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 09:08:43,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 09:08:43,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 09:08:43,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 09:08:43,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 09:08:43,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 09:08:43,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 09:08:43,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 09:08:43,202 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:43,236 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 09:08:43,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 09:08:43,237 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 09:08:43,238 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 09:08:43,238 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 09:08:43,239 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 09:08:43,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 09:08:43,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 09:08:43,240 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 09:08:43,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 09:08:43,241 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 09:08:43,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 09:08:43,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 09:08:43,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 09:08:43,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 09:08:43,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 09:08:43,242 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 09:08:43,242 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 09:08:43,242 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 09:08:43,242 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 09:08:43,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 09:08:43,243 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 09:08:43,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 09:08:43,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 09:08:43,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 09:08:43,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 09:08:43,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:08:43,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 09:08:43,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 09:08:43,244 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 09:08:43,244 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 09:08:43,245 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 09:08:43,245 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 09:08:43,245 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 09:08:43,245 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 09:08:43,245 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 09:08:43,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 09:08:43,246 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2021-12-17 09:08:43,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 09:08:43,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 09:08:43,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 09:08:43,577 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 09:08:43,579 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 09:08:43,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2021-12-17 09:08:43,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3324039ee/6b7d745aab364bda990f83f6e9345a58/FLAG4e7143f09 [2021-12-17 09:08:44,110 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 09:08:44,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2021-12-17 09:08:44,121 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3324039ee/6b7d745aab364bda990f83f6e9345a58/FLAG4e7143f09 [2021-12-17 09:08:44,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3324039ee/6b7d745aab364bda990f83f6e9345a58 [2021-12-17 09:08:44,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 09:08:44,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 09:08:44,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 09:08:44,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 09:08:44,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 09:08:44,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:08:44" (1/1) ... [2021-12-17 09:08:44,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64421a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:44, skipping insertion in model container [2021-12-17 09:08:44,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:08:44" (1/1) ... [2021-12-17 09:08:44,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 09:08:44,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 09:08:44,481 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_unequal.i[24323,24336] [2021-12-17 09:08:44,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:08:44,490 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 09:08:44,532 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_unequal.i[24323,24336] [2021-12-17 09:08:44,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:08:44,560 INFO L208 MainTranslator]: Completed translation [2021-12-17 09:08:44,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:44 WrapperNode [2021-12-17 09:08:44,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 09:08:44,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 09:08:44,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 09:08:44,562 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 09:08:44,567 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:44" (1/1) ... [2021-12-17 09:08:44,605 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:44" (1/1) ... [2021-12-17 09:08:44,625 INFO L137 Inliner]: procedures = 130, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 135 [2021-12-17 09:08:44,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 09:08:44,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 09:08:44,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 09:08:44,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 09:08:44,632 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:44" (1/1) ... [2021-12-17 09:08:44,632 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:44" (1/1) ... [2021-12-17 09:08:44,635 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:44" (1/1) ... [2021-12-17 09:08:44,635 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:44" (1/1) ... [2021-12-17 09:08:44,648 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:44" (1/1) ... [2021-12-17 09:08:44,659 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:44" (1/1) ... [2021-12-17 09:08:44,662 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:44" (1/1) ... [2021-12-17 09:08:44,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 09:08:44,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 09:08:44,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 09:08:44,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 09:08:44,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:44" (1/1) ... [2021-12-17 09:08:44,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:08:44,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:08:44,696 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:44,704 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:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-17 09:08:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-17 09:08:44,744 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-17 09:08:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 09:08:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 09:08:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 09:08:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 09:08:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 09:08:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 09:08:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-17 09:08:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 09:08:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 09:08:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 09:08:44,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 09:08:44,897 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 09:08:44,898 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 09:08:45,114 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 09:08:45,119 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 09:08:45,119 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-17 09:08:45,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:08:45 BoogieIcfgContainer [2021-12-17 09:08:45,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 09:08:45,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 09:08:45,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 09:08:45,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 09:08:45,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:08:44" (1/3) ... [2021-12-17 09:08:45,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3814a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:08:45, skipping insertion in model container [2021-12-17 09:08:45,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:08:44" (2/3) ... [2021-12-17 09:08:45,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3814a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:08:45, skipping insertion in model container [2021-12-17 09:08:45,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:08:45" (3/3) ... [2021-12-17 09:08:45,127 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2021-12-17 09:08:45,130 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 09:08:45,131 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 09:08:45,166 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 09:08:45,171 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:45,171 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 09:08:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 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:45,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 09:08:45,186 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:45,187 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:45,187 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:45,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:45,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1473722618, now seen corresponding path program 1 times [2021-12-17 09:08:45,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:08:45,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134229569] [2021-12-17 09:08:45,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:45,203 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:08:45,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:08:45,207 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:45,259 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:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:45,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 09:08:45,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:45,409 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:45,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 09:08:45,410 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:08:45,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134229569] [2021-12-17 09:08:45,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134229569] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:08:45,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:08:45,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 09:08:45,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649662796] [2021-12-17 09:08:45,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:08:45,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 09:08:45,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:08:45,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 09:08:45,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 09:08:45,446 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 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:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:45,466 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2021-12-17 09:08:45,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 09:08:45,467 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:45,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:45,472 INFO L225 Difference]: With dead ends: 64 [2021-12-17 09:08:45,473 INFO L226 Difference]: Without dead ends: 29 [2021-12-17 09:08:45,475 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:45,477 INFO L933 BasicCegarLoop]: 44 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, 44 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:45,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 44 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:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-17 09:08:45,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-17 09:08:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-12-17 09:08:45,503 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 17 [2021-12-17 09:08:45,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:45,503 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-12-17 09:08:45,503 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:45,503 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2021-12-17 09:08:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 09:08:45,504 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:45,504 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:45,518 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:45,715 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:45,716 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:45,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:45,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1996757262, now seen corresponding path program 1 times [2021-12-17 09:08:45,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:08:45,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224354138] [2021-12-17 09:08:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:45,717 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:08:45,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:08:45,719 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:45,721 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:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:45,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 09:08:45,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:45,882 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:45,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 09:08:45,882 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:08:45,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224354138] [2021-12-17 09:08:45,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224354138] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:08:45,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:08:45,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 09:08:45,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794122049] [2021-12-17 09:08:45,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:08:45,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 09:08:45,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:08:45,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 09:08:45,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 09:08:45,885 INFO L87 Difference]: Start difference. First operand 29 states and 36 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:45,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:45,900 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2021-12-17 09:08:45,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 09:08:45,902 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:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:45,902 INFO L225 Difference]: With dead ends: 56 [2021-12-17 09:08:45,902 INFO L226 Difference]: Without dead ends: 33 [2021-12-17 09:08:45,903 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:45,904 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 67 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:45,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 67 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:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-17 09:08:45,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2021-12-17 09:08:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-12-17 09:08:45,910 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 17 [2021-12-17 09:08:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:45,910 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-17 09:08:45,910 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:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2021-12-17 09:08:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 09:08:45,911 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:45,911 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:45,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-17 09:08:46,123 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:46,124 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:46,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:46,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1017886446, now seen corresponding path program 1 times [2021-12-17 09:08:46,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:08:46,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152848870] [2021-12-17 09:08:46,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:46,125 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:08:46,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:08:46,126 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:46,128 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:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:46,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 09:08:46,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:46,326 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:46,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:08:46,433 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:46,434 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:08:46,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152848870] [2021-12-17 09:08:46,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152848870] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:08:46,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:08:46,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-17 09:08:46,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087365788] [2021-12-17 09:08:46,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:08:46,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 09:08:46,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:08:46,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 09:08:46,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 09:08:46,436 INFO L87 Difference]: Start difference. First operand 30 states and 37 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:46,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:46,487 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2021-12-17 09:08:46,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 09:08:46,488 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:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:46,489 INFO L225 Difference]: With dead ends: 60 [2021-12-17 09:08:46,489 INFO L226 Difference]: Without dead ends: 37 [2021-12-17 09:08:46,490 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:46,491 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:08:46,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 134 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:08:46,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-17 09:08:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2021-12-17 09:08:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 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:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2021-12-17 09:08:46,496 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 26 [2021-12-17 09:08:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:46,497 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2021-12-17 09:08:46,497 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:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2021-12-17 09:08:46,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 09:08:46,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:46,498 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:46,511 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:46,698 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:46,699 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:46,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:46,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1383615218, now seen corresponding path program 2 times [2021-12-17 09:08:46,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:08:46,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479473713] [2021-12-17 09:08:46,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:08:46,701 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:08:46,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:08:46,702 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:46,703 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:46,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:08:46,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:08:46,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-17 09:08:46,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:47,127 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:47,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:47,329 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:47,398 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:47,435 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:47,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:08:47,564 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:08:47,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479473713] [2021-12-17 09:08:47,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479473713] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:47,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [462962092] [2021-12-17 09:08:47,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:08:47,565 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:08:47,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:08:47,568 INFO L229 MonitoredProcess]: Starting monitored process 6 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:47,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-12-17 09:08:47,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:08:47,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:08:47,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 09:08:47,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:48,127 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:48,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:48,233 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:48,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:08:48,310 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:48,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:08:48,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [462962092] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:48,407 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:08:48,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2021-12-17 09:08:48,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441619865] [2021-12-17 09:08:48,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:08:48,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 09:08:48,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:08:48,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 09:08:48,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=420, Unknown=6, NotChecked=0, Total=506 [2021-12-17 09:08:48,410 INFO L87 Difference]: Start difference. First operand 34 states and 42 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:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:08:48,711 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2021-12-17 09:08:48,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 09:08:48,713 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:48,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:08:48,714 INFO L225 Difference]: With dead ends: 44 [2021-12-17 09:08:48,714 INFO L226 Difference]: Without dead ends: 34 [2021-12-17 09:08:48,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=580, Unknown=7, NotChecked=0, Total=702 [2021-12-17 09:08:48,715 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:08:48,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 177 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 27 Unchecked, 0.2s Time] [2021-12-17 09:08:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-17 09:08:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-17 09:08:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 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:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-12-17 09:08:48,721 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 35 [2021-12-17 09:08:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:08:48,721 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-12-17 09:08:48,721 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:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2021-12-17 09:08:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 09:08:48,722 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:08:48,723 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:48,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-17 09:08:48,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2021-12-17 09:08:49,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-17 09:08:49,123 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:08:49,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:08:49,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1699814766, now seen corresponding path program 1 times [2021-12-17 09:08:49,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:08:49,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962688524] [2021-12-17 09:08:49,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:49,125 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:08:49,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:08:49,126 INFO L229 MonitoredProcess]: Starting monitored process 7 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:49,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-17 09:08:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:49,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-17 09:08:49,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:49,528 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:49,692 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:49,700 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:08:49,974 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:08:49,975 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:08:49,983 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:50,257 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 09:08:50,258 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 14 treesize of output 20 [2021-12-17 09:08:50,273 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:50,312 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-17 09:08:50,312 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 31 treesize of output 41 [2021-12-17 09:08:50,324 INFO L354 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2021-12-17 09:08:50,324 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 16 treesize of output 16 [2021-12-17 09:08:50,332 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 17 treesize of output 13 [2021-12-17 09:08:50,828 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:08:50,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:08:50,910 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.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|)))) (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_261) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))) (_ bv0 32)))) is different from false [2021-12-17 09:08:51,672 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:08:51,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962688524] [2021-12-17 09:08:51,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962688524] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:08:51,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [199971491] [2021-12-17 09:08:51,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:08:51,673 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:08:51,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:08:51,680 INFO L229 MonitoredProcess]: Starting monitored process 8 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:51,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-12-17 09:08:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:08:51,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-17 09:08:51,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:08:52,479 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:52,626 WARN L860 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) |c_node_create_#res#1.base|)) (exists ((v_ArrVal_326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_326))) (not (= (_ bv0 32) (bvadd |c_#StackHeapBarrier| (_ bv1 32)))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2021-12-17 09:08:52,695 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 09:08:52,695 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 14 treesize of output 20 [2021-12-17 09:08:52,700 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:53,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:08:53,114 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 0 case distinctions, treesize of input 51 treesize of output 41 [2021-12-17 09:08:53,127 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-12-17 09:08:53,128 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 68 treesize of output 54 [2021-12-17 09:08:53,229 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:08:53,235 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:08:53,235 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 41 treesize of output 17 [2021-12-17 09:08:53,239 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:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2021-12-17 09:08:53,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:08:53,928 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:08:53,928 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 311 treesize of output 271 [2021-12-17 09:10:06,844 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimIndex_7 (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32))) (let ((.cse0 (not (= v_arrayElimIndex_7 v_arrayElimCell_29)))) (or (and .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_append_~head#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (let ((.cse7 (= |c_ULTIMATE.start_main_~#s~0#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)))) (.cse6 (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_29))) (let ((.cse10 (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| (_ bv0 32)))) (.cse11 (forall ((v_ArrVal_329 (_ BitVec 32))) (not (let ((.cse35 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.offset| v_arrayElimCell_29 (store (select |c_#memory_$Pointer$.offset| v_arrayElimCell_29) (bvadd .cse35 (_ bv4 32)) v_ArrVal_329)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse35))))) (.cse8 (not .cse6)) (.cse9 (not .cse7))) (and (forall ((v_ArrVal_329 (_ BitVec 32))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| v_arrayElimCell_29 (store (select |c_#memory_$Pointer$.offset| v_arrayElimCell_29) (bvadd .cse5 (_ bv4 32)) v_ArrVal_329)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (bvadd .cse4 (_ bv4 32)))) (let ((.cse2 (not (= (_ bv0 32) v_arrayElimCell_29))) (.cse3 (= .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (and (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_7) (not (= v_arrayElimIndex_7 (_ bv0 32))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse1)) (and .cse2 (= v_arrayElimIndex_7 |c_ULTIMATE.start_sll_append_~head#1.base|) .cse3) (and (or (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| v_arrayElimCell_29) (= v_arrayElimIndex_7 v_arrayElimCell_29)) (= .cse4 .cse5)) (and (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) .cse2 .cse3))))))) (or (and (or .cse0 (and .cse6 .cse7)) (or .cse8 .cse9 (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| v_arrayElimCell_29)))) .cse10 .cse11) (or (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| v_arrayElimIndex_7) (and (or (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) (and (or (forall ((v_ArrVal_329 (_ BitVec 32))) (= (bvadd (select (select (store |c_#memory_$Pointer$.offset| v_arrayElimCell_29 (store (select |c_#memory_$Pointer$.offset| v_arrayElimCell_29) (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_329)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse8 .cse9) (or .cse8 .cse9 .cse10 .cse11) (forall ((v_ArrVal_329 (_ BitVec 32))) (let ((.cse13 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse18 (bvadd .cse13 (_ bv4 32)))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$.offset| v_arrayElimCell_29 (store (select |c_#memory_$Pointer$.offset| v_arrayElimCell_29) .cse18 v_ArrVal_329)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (or (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| v_arrayElimCell_29) (= v_arrayElimIndex_7 v_arrayElimCell_29)) (= .cse12 .cse13)) (let ((.cse14 (not (= v_arrayElimIndex_7 (_ bv0 32)))) (.cse16 (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_29)) (.cse17 (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse18))) (and (let ((.cse15 (bvadd .cse12 (_ bv4 32)))) (or (and (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_7) .cse14 (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse15)) (and (not (= (_ bv0 32) v_arrayElimCell_29)) (= v_arrayElimIndex_7 |c_ULTIMATE.start_sll_append_~head#1.base|) (= .cse15 |c_ULTIMATE.start_sll_append_~head#1.offset|)) (and .cse16 .cse17))) (or .cse14 (not .cse16) (not .cse17))))))))) (or (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse8 .cse9))) (forall ((v_ArrVal_329 (_ BitVec 32))) (let ((.cse27 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse28 (bvadd .cse27 (_ bv4 32)))) (let ((.cse26 (select (select (store |c_#memory_$Pointer$.offset| v_arrayElimCell_29 (store (select |c_#memory_$Pointer$.offset| v_arrayElimCell_29) .cse28 v_ArrVal_329)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse23 (bvadd .cse26 (_ bv4 32)))) (or (let ((.cse25 (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_29)) (.cse20 (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse28))) (let ((.cse21 (= v_arrayElimIndex_7 v_arrayElimCell_29)) (.cse24 (and .cse25 .cse20)) (.cse22 (= .cse26 .cse27))) (and (let ((.cse19 (not .cse25))) (or (and (or .cse19 (not .cse20)) .cse21 .cse22) (and (or (and (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_7) (not (= v_arrayElimIndex_7 (_ bv0 32))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse23)) (and (not (= (_ bv0 32) v_arrayElimCell_29)) (= v_arrayElimIndex_7 |c_ULTIMATE.start_sll_append_~head#1.base|) (= .cse23 |c_ULTIMATE.start_sll_append_~head#1.offset|)) .cse24) (or (not (= v_arrayElimCell_29 (_ bv0 32))) .cse19)))) (or (not .cse21) .cse24 (not .cse22) (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| (_ bv0 32))))))) (and (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= v_arrayElimCell_29 v_arrayElimIndex_7))))))))) (forall ((v_ArrVal_329 (_ BitVec 32))) (let ((.cse33 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse34 (bvadd .cse33 (_ bv4 32)))) (let ((.cse32 (select (select (store |c_#memory_$Pointer$.offset| v_arrayElimCell_29 (store (select |c_#memory_$Pointer$.offset| v_arrayElimCell_29) .cse34 v_ArrVal_329)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse31 (bvadd .cse32 (_ bv4 32)))) (or (let ((.cse29 (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_29))) (.cse30 (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse34)))) (and (or .cse29 .cse30 (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| (_ bv0 32)))) (or (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse29 .cse30) (or (and (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_7) (not (= v_arrayElimIndex_7 (_ bv0 32))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse31)) (and (or (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| v_arrayElimCell_29) (= v_arrayElimIndex_7 v_arrayElimCell_29)) (= .cse32 .cse33))))) (= .cse31 |c_ULTIMATE.start_sll_append_~head#1.offset|))))))))))))))) is different from false [2021-12-17 09:10:30,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [199971491] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:10:30,578 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:10:30,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 38 [2021-12-17 09:10:30,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224818653] [2021-12-17 09:10:30,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:10:30,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-17 09:10:30,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:10:30,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-17 09:10:30,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1950, Unknown=12, NotChecked=276, Total=2450 [2021-12-17 09:10:30,581 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 38 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 30 states have internal predecessors, (61), 5 states have call successors, (5), 4 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:10:31,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:10:31,474 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2021-12-17 09:10:31,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 09:10:31,475 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 30 states have internal predecessors, (61), 5 states have call successors, (5), 4 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:10:31,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:10:31,477 INFO L225 Difference]: With dead ends: 48 [2021-12-17 09:10:31,478 INFO L226 Difference]: Without dead ends: 37 [2021-12-17 09:10:31,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=325, Invalid=2755, Unknown=12, NotChecked=330, Total=3422 [2021-12-17 09:10:31,480 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:10:31,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 423 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 104 Unchecked, 0.3s Time] [2021-12-17 09:10:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-17 09:10:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2021-12-17 09:10:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 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:10:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2021-12-17 09:10:31,486 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 38 [2021-12-17 09:10:31,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:10:31,486 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2021-12-17 09:10:31,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 30 states have internal predecessors, (61), 5 states have call successors, (5), 4 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:10:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2021-12-17 09:10:31,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 09:10:31,487 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:10:31,488 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:10:31,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2021-12-17 09:10:31,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-17 09:10:31,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:10:31,892 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:10:31,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:10:31,892 INFO L85 PathProgramCache]: Analyzing trace with hash 968809289, now seen corresponding path program 1 times [2021-12-17 09:10:31,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:10:31,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179398421] [2021-12-17 09:10:31,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:31,893 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:10:31,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:10:31,894 INFO L229 MonitoredProcess]: Starting monitored process 9 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:31,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-17 09:10:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:32,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-17 09:10:32,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:10:32,098 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:32,124 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:32,229 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:10:32,230 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:10:32,334 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:10:32,475 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 09:10:32,476 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:32,554 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:32,578 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:10:32,861 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:10:32,862 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 78 treesize of output 37 [2021-12-17 09:10:32,871 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:32,880 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:33,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:33,107 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:10:33,108 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 84 treesize of output 68 [2021-12-17 09:10:33,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:33,160 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:10:33,161 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:33,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:33,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, 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:10:33,880 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-17 09:10:33,881 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 109 treesize of output 84 [2021-12-17 09:10:33,912 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 09:10:33,913 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 28 treesize of output 31 [2021-12-17 09:10:34,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:34,050 INFO L354 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2021-12-17 09:10:34,051 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 86 treesize of output 34 [2021-12-17 09:10:34,058 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:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:10:34,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:10:34,232 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_398 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_399 (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_399))) (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_398) |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:10:34,258 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_398 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 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))))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_399))) (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 v_ArrVal_398) |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:10:34,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_398 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse1 (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 (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_399))) (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 v_ArrVal_398) |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:10:34,493 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:10:34,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179398421] [2021-12-17 09:10:34,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179398421] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:10:34,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1934361270] [2021-12-17 09:10:34,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:10:34,494 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:10:34,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:10:34,495 INFO L229 MonitoredProcess]: Starting monitored process 10 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:34,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-12-17 09:10:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:10:34,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-17 09:10:34,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:10:34,850 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:10:35,419 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:10:35,420 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:10:35,527 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:10:35,937 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:10:35,937 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:10:35,943 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:10:35,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, 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:36,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:36,338 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:10:36,338 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:10:36,367 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:10:36,367 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:10:36,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:36,382 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:10:38,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:38,008 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:10:38,082 INFO L354 Elim1Store]: treesize reduction 146, result has 19.3 percent of original size [2021-12-17 09:10:38,083 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 89 [2021-12-17 09:10:38,111 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-17 09:10:38,111 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 132 treesize of output 100 [2021-12-17 09:10:38,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:10:38,361 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:10:38,361 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 99 treesize of output 30 [2021-12-17 09:10:38,369 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:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:10:38,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:10:51,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_15| (_ BitVec 32)) (v_ArrVal_469 (_ BitVec 32)) (v_ArrVal_471 (_ BitVec 32))) (let ((.cse3 (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 ((.cse0 (select |c_#memory_$Pointer$.base| .cse3)) (.cse1 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_15| (_ bv4 32)))) (or (not (= (_ bv0 32) (select .cse0 .cse1))) (not (= (_ bv0 32) (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse3 (store .cse0 .cse1 v_ArrVal_471)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse1 v_ArrVal_469)) |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:11:36,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1934361270] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:11:36,899 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:11:36,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 43 [2021-12-17 09:11:36,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642620270] [2021-12-17 09:11:36,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:11:36,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-17 09:11:36,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:11:36,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-17 09:11:36,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2206, Unknown=45, NotChecked=396, Total=2862 [2021-12-17 09:11:36,901 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 43 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 35 states have internal predecessors, (64), 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:11:39,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:11:39,459 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2021-12-17 09:11:39,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 09:11:39,460 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 35 states have internal predecessors, (64), 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:11:39,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:11:39,460 INFO L225 Difference]: With dead ends: 50 [2021-12-17 09:11:39,460 INFO L226 Difference]: Without dead ends: 47 [2021-12-17 09:11:39,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 63.5s TimeCoverageRelationStatistics Valid=388, Invalid=3741, Unknown=47, NotChecked=516, Total=4692 [2021-12-17 09:11:39,462 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:11:39,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 528 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 146 Unchecked, 0.2s Time] [2021-12-17 09:11:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-17 09:11:39,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-12-17 09:11:39,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 09:11:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2021-12-17 09:11:39,471 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 40 [2021-12-17 09:11:39,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:11:39,471 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2021-12-17 09:11:39,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 35 states have internal predecessors, (64), 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:11:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2021-12-17 09:11:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 09:11:39,473 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:11:39,473 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:11:39,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-17 09:11:39,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-12-17 09:11:39,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-17 09:11:39,876 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:11:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:11:39,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1006966459, now seen corresponding path program 1 times [2021-12-17 09:11:39,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:11:39,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610046098] [2021-12-17 09:11:39,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:11:39,877 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:11:39,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:11:39,878 INFO L229 MonitoredProcess]: Starting monitored process 11 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:39,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-17 09:11:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:11:40,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-17 09:11:40,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:11:40,104 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:40,133 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:11:40,246 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:11:40,246 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:40,355 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:40,431 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:11:40,522 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 09:11:40,523 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:11:40,614 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:40,624 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:40,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 19 treesize of output 18 [2021-12-17 09:11:40,965 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:11:40,965 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:11:40,972 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:40,978 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:40,983 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:11:41,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:41,236 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:11:41,236 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:11:41,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:41,248 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:41,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:41,289 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:11:41,289 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:11:41,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:41,315 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:11:42,145 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-17 09:11:42,146 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:11:42,173 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 09:11:42,173 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:11:42,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:42,187 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:11:42,341 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:11:42,341 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:11:42,349 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:11:42,478 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:11:42,520 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:11:42,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:11:42,667 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_548 (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_550) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_549) |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_548) |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:42,696 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_548 (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_550) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_549) |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_548) |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:42,720 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_548 (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_550) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_549) |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_548) |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:43,050 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:11:43,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610046098] [2021-12-17 09:11:43,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610046098] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:11:43,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1846234683] [2021-12-17 09:11:43,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:11:43,051 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:11:43,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:11:43,051 INFO L229 MonitoredProcess]: Starting monitored process 12 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:43,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2021-12-17 09:11:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:11:43,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-17 09:11:43,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:11:43,453 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:43,846 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:11:44,048 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:11:44,200 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:11:44,200 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:44,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:44,333 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:44,342 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:44,895 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:11:44,896 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:11:44,901 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:44,906 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:11:44,911 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:11:45,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:45,184 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:11:45,184 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:11:45,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:45,196 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:11:45,226 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:11:45,227 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:11:45,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:45,245 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:11:46,213 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-17 09:11:46,213 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:11:46,242 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 09:11:46,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, 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:11:46,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:46,253 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:11:46,464 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:11:46,464 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:11:46,473 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:11:46,604 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:11:46,608 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:11:46,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:11:46,632 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (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_630) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_629) |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_631) |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:46,658 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (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_630) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_629) |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_631) |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:46,681 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (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_630) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_629) |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_631) |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:47,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1846234683] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:11:47,673 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:11:47,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 41 [2021-12-17 09:11:47,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226452070] [2021-12-17 09:11:47,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:11:47,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-17 09:11:47,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:11:47,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-17 09:11:47,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1906, Unknown=22, NotChecked=558, Total=2652 [2021-12-17 09:11:47,675 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 41 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 32 states have internal predecessors, (63), 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:11:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:11:50,392 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2021-12-17 09:11:50,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 09:11:50,393 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 32 states have internal predecessors, (63), 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 42 [2021-12-17 09:11:50,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:11:50,394 INFO L225 Difference]: With dead ends: 58 [2021-12-17 09:11:50,394 INFO L226 Difference]: Without dead ends: 56 [2021-12-17 09:11:50,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=297, Invalid=3244, Unknown=23, NotChecked=726, Total=4290 [2021-12-17 09:11:50,396 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:11:50,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 311 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 205 Invalid, 0 Unknown, 121 Unchecked, 0.4s Time] [2021-12-17 09:11:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-12-17 09:11:50,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2021-12-17 09:11:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 09:11:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2021-12-17 09:11:50,412 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 42 [2021-12-17 09:11:50,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:11:50,412 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2021-12-17 09:11:50,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 32 states have internal predecessors, (63), 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:11:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2021-12-17 09:11:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 09:11:50,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:11:50,413 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:50,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-17 09:11:50,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2021-12-17 09:11:50,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-17 09:11:50,836 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:11:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:11:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1447784860, now seen corresponding path program 2 times [2021-12-17 09:11:50,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:11:50,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131129836] [2021-12-17 09:11:50,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:11:50,837 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:11:50,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:11:50,838 INFO L229 MonitoredProcess]: Starting monitored process 13 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:50,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-17 09:11:51,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:11:51,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:11:51,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-17 09:11:51,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:11:51,159 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:51,308 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:11:51,528 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:11:51,528 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 23 [2021-12-17 09:11:51,533 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:11:51,537 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:11:51,763 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 09:11:51,763 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 14 treesize of output 20 [2021-12-17 09:11:51,766 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:11:51,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:11:51,799 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:11:51,799 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 46 treesize of output 48 [2021-12-17 09:11:51,813 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 09:11:51,814 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 1 case distinctions, treesize of input 18 treesize of output 18 [2021-12-17 09:11:52,456 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-17 09:11:52,457 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 21 treesize of output 20 [2021-12-17 09:11:52,512 INFO L354 Elim1Store]: treesize reduction 75, result has 24.2 percent of original size [2021-12-17 09:11:52,513 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 5 case distinctions, treesize of input 58 treesize of output 54 [2021-12-17 09:11:52,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:11:52,864 INFO L354 Elim1Store]: treesize reduction 37, result has 28.8 percent of original size [2021-12-17 09:11:52,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 52 [2021-12-17 09:11:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:11:52,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:12:01,342 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (_ BitVec 32)) (|ULTIMATE.start_sll_append_~last~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_sll_append_~last~0#1.offset| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (bvadd |ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32)))) (or (not (= (select .cse0 .cse1) (_ bv0 32))) (not (= (_ bv0 32) (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~last~0#1.base|) .cse1 v_ArrVal_706)) |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:12:03,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (_ BitVec 32)) (|ULTIMATE.start_sll_append_~last~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_sll_append_~last~0#1.offset| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (bvadd |ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32)))) (or (not (= (select .cse0 .cse1) (_ bv0 32))) (not (= (_ bv0 32) (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~last~0#1.base|) .cse1 v_ArrVal_706)) |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:12:03,756 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:12:03,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131129836] [2021-12-17 09:12:03,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131129836] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:12:03,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1034510807] [2021-12-17 09:12:03,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:12:03,756 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:12:03,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:12:03,757 INFO L229 MonitoredProcess]: Starting monitored process 14 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:03,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2021-12-17 09:12:04,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:12:04,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:12:04,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 83 conjunts are in the unsatisfiable core [2021-12-17 09:12:04,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:12:04,116 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:12:04,360 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:04,797 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 09:12:04,797 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 16 treesize of output 22 [2021-12-17 09:12:04,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 7 treesize of output 3 [2021-12-17 09:12:04,836 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:12:04,836 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,002 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:05,014 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:12:05,626 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 09:12:05,627 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 68 treesize of output 42 [2021-12-17 09:12:05,634 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,643 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:12:05,644 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:12:10,171 INFO L354 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2021-12-17 09:12:10,171 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 77 [2021-12-17 09:12:10,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:12:10,200 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-17 09:12:10,200 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 2 case distinctions, treesize of input 21 treesize of output 30 [2021-12-17 09:12:10,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:12:10,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:12:10,214 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 09:12:10,215 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 27 treesize of output 25 [2021-12-17 09:12:10,261 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:12,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:12:12,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:12:12,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:12:12,296 INFO L354 Elim1Store]: treesize reduction 306, result has 12.3 percent of original size [2021-12-17 09:12:12,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 167 treesize of output 106 [2021-12-17 09:12:12,357 INFO L354 Elim1Store]: treesize reduction 88, result has 17.0 percent of original size [2021-12-17 09:12:12,358 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 6 case distinctions, treesize of input 258 treesize of output 209 [2021-12-17 09:12:12,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:12:12,948 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 105 [2021-12-17 09:12:12,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:12:12,981 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 84 [2021-12-17 09:12:14,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:12:15,070 INFO L354 Elim1Store]: treesize reduction 306, result has 43.1 percent of original size [2021-12-17 09:12:15,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 2 disjoint index pairs (out of 55 index pairs), introduced 18 new quantified variables, introduced 55 case distinctions, treesize of input 330 treesize of output 338 [2021-12-17 09:12:15,105 INFO L354 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2021-12-17 09:12:15,105 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 345 treesize of output 335 [2021-12-17 09:13:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:13:05,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:13:05,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_append_~last~0#1.offset| (_ BitVec 32))) (not (= (_ bv0 32) (select (let ((.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 |ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (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_783) |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:13:05,578 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_29| (_ BitVec 32))) (not (= (_ bv0 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))))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_29| (_ bv4 32)) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (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 v_ArrVal_783) |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:13:05,612 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_29| (_ BitVec 32))) (not (= (_ bv0 32) (let ((.cse1 (let ((.cse2 (bvadd |c_ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32)))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2) (_ bv4 32)))))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_29| (_ bv4 32)) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (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 v_ArrVal_783) |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:13:05,649 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_29| (_ BitVec 32))) (not (= (_ bv0 32) (let ((.cse1 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse3 (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 |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse2) .cse3)) (bvadd (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) (_ bv4 32)))))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_29| (_ bv4 32)) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (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 v_ArrVal_783) |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:13:05,685 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_29| (_ BitVec 32))) (not (= (_ bv0 32) (let ((.cse1 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse3 (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 |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse2) .cse3)) (bvadd (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) (_ bv4 32)))))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_29| (_ bv4 32)) |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)))) (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 v_ArrVal_783) |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:13:07,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1034510807] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:13:07,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:13:07,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 45 [2021-12-17 09:13:07,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830924357] [2021-12-17 09:13:07,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:13:07,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-17 09:13:07,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:13:07,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-17 09:13:07,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2342, Unknown=22, NotChecked=728, Total=3306 [2021-12-17 09:13:07,434 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 45 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 35 states have internal predecessors, (66), 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:13:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:13:15,222 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2021-12-17 09:13:15,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-17 09:13:15,222 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 35 states have internal predecessors, (66), 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:13:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:13:15,223 INFO L225 Difference]: With dead ends: 70 [2021-12-17 09:13:15,223 INFO L226 Difference]: Without dead ends: 67 [2021-12-17 09:13:15,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1612 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=382, Invalid=4316, Unknown=22, NotChecked=980, Total=5700 [2021-12-17 09:13:15,227 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:13:15,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 538 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 204 Invalid, 0 Unknown, 221 Unchecked, 0.4s Time] [2021-12-17 09:13:15,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-17 09:13:15,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2021-12-17 09:13:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 09:13:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2021-12-17 09:13:15,235 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 42 [2021-12-17 09:13:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:13:15,235 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2021-12-17 09:13:15,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 35 states have internal predecessors, (66), 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:13:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2021-12-17 09:13:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-17 09:13:15,236 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:13:15,236 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, 1] [2021-12-17 09:13:15,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2021-12-17 09:13:15,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-17 09:13:15,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:13:15,641 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:13:15,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:13:15,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1151243655, now seen corresponding path program 1 times [2021-12-17 09:13:15,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:13:15,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079185596] [2021-12-17 09:13:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:13:15,642 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:13:15,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:13:15,643 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:13:15,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-17 09:13:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:13:15,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 09:13:15,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:13:15,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 31 treesize of output 19 [2021-12-17 09:13:15,853 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:13:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-17 09:13:15,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 09:13:15,869 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:13:15,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079185596] [2021-12-17 09:13:15,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079185596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:13:15,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:13:15,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 09:13:15,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190444221] [2021-12-17 09:13:15,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:13:15,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 09:13:15,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:13:15,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 09:13:15,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 09:13:15,870 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:13:15,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:13:15,988 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2021-12-17 09:13:15,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 09:13:15,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 43 [2021-12-17 09:13:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:13:15,989 INFO L225 Difference]: With dead ends: 59 [2021-12-17 09:13:15,989 INFO L226 Difference]: Without dead ends: 54 [2021-12-17 09:13:15,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 09:13:15,990 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:13:15,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:13:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-17 09:13:15,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2021-12-17 09:13:15,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 09:13:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-12-17 09:13:15,998 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 43 [2021-12-17 09:13:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:13:15,998 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-12-17 09:13:15,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:13:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-12-17 09:13:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 09:13:15,999 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:13:16,000 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, 1, 1] [2021-12-17 09:13:16,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-17 09:13:16,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:13:16,208 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:13:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:13:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash 223363488, now seen corresponding path program 2 times [2021-12-17 09:13:16,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:13:16,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575798368] [2021-12-17 09:13:16,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:13:16,209 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:13:16,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:13:16,210 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:13:16,212 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:13:16,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:13:16,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:13:16,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-17 09:13:16,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:13:16,481 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:16,576 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:16,582 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:16,853 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 09:13:16,853 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:13:16,863 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:13:16,891 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:13:16,892 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:16,908 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:13:16,991 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:13:16,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 27 treesize of output 26 [2021-12-17 09:13:17,282 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:13:17,309 INFO L354 Elim1Store]: treesize reduction 11, result has 71.8 percent of original size [2021-12-17 09:13:17,309 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:13:17,322 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-17 09:13:17,322 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:13:17,331 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:17,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:17,576 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-17 09:13:17,576 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:13:17,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:17,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:17,609 INFO L354 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2021-12-17 09:13:17,609 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:13:17,635 INFO L354 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2021-12-17 09:13:17,635 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:13:18,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:13:18,557 INFO L354 Elim1Store]: treesize reduction 54, result has 37.9 percent of original size [2021-12-17 09:13:18,558 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 93 [2021-12-17 09:13:21,640 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:13:21,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:13:22,241 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:13:22,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575798368] [2021-12-17 09:13:22,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575798368] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:13:22,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1268318313] [2021-12-17 09:13:22,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:13:22,242 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:13:22,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:13:22,243 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:13:22,244 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:13:22,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:13:22,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:13:22,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 98 conjunts are in the unsatisfiable core [2021-12-17 09:13:22,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:13:22,689 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:22,845 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:23,238 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:13:23,434 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 09:13:23,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 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-17 09:13:23,443 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:13:23,481 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:13:23,481 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:13:23,674 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:13:23,679 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 27 treesize of output 26 [2021-12-17 09:13:23,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:23,696 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:13:24,331 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:13:24,332 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 98 treesize of output 53 [2021-12-17 09:13:24,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:24,346 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:13:24,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 10 [2021-12-17 09:13:24,354 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:13:24,359 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:13:28,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:28,994 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 09:13:28,994 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 112 treesize of output 81 [2021-12-17 09:13:29,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:29,008 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:13:29,041 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:13:29,042 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:13:29,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:29,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:29,071 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 09:13:29,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 48 [2021-12-17 09:13:31,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:31,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:31,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:13:32,157 INFO L354 Elim1Store]: treesize reduction 259, result has 18.8 percent of original size [2021-12-17 09:13:32,157 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 502 treesize of output 212 [2021-12-17 09:13:32,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:32,362 INFO L354 Elim1Store]: treesize reduction 232, result has 15.9 percent of original size [2021-12-17 09:13:32,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 119 treesize of output 101 [2021-12-17 09:13:32,386 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:13:35,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:35,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:35,517 INFO L354 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2021-12-17 09:13:35,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 229 treesize of output 139 [2021-12-17 09:13:35,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:35,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:35,575 INFO L354 Elim1Store]: treesize reduction 4, result has 81.0 percent of original size [2021-12-17 09:13:35,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 79 [2021-12-17 09:13:36,458 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:13:36,557 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:13:36,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:13:51,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1268318313] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:13:51,473 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:13:51,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 43 [2021-12-17 09:13:51,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342776941] [2021-12-17 09:13:51,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:13:51,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-17 09:13:51,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:13:51,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-17 09:13:51,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3082, Unknown=28, NotChecked=0, Total=3306 [2021-12-17 09:13:51,475 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 43 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 35 states have internal predecessors, (70), 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:13:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:13:58,553 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2021-12-17 09:13:58,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-17 09:13:58,554 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 35 states have internal predecessors, (70), 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:13:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:13:58,555 INFO L225 Difference]: With dead ends: 88 [2021-12-17 09:13:58,555 INFO L226 Difference]: Without dead ends: 73 [2021-12-17 09:13:58,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1630 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=389, Invalid=5738, Unknown=35, NotChecked=0, Total=6162 [2021-12-17 09:13:58,557 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:13:58,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 421 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 335 Unchecked, 0.4s Time] [2021-12-17 09:13:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-17 09:13:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2021-12-17 09:13:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-17 09:13:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2021-12-17 09:13:58,571 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 44 [2021-12-17 09:13:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:13:58,571 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2021-12-17 09:13:58,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 35 states have internal predecessors, (70), 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:13:58,571 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2021-12-17 09:13:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-17 09:13:58,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:13:58,572 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, 1] [2021-12-17 09:13:58,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2021-12-17 09:13:58,785 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:13:58,975 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:13:58,976 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:13:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:13:58,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1809434049, now seen corresponding path program 1 times [2021-12-17 09:13:58,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:13:58,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716285979] [2021-12-17 09:13:58,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:13:58,977 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:13:58,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:13:58,977 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:13:58,978 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:13:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:13:59,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 90 conjunts are in the unsatisfiable core [2021-12-17 09:13:59,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:13:59,334 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:59,361 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:59,442 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:59,515 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:13:59,515 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:59,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:13:59,581 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:13:59,670 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:59,675 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:13:59,870 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 09:13:59,870 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 14 treesize of output 20 [2021-12-17 09:13:59,879 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:13:59,940 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 09:13:59,940 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:14:00,067 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:14:00,073 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:14:00,107 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:00,519 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:14:00,519 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 92 treesize of output 47 [2021-12-17 09:14:00,526 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:00,533 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:14:00,540 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:14:00,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:00,820 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:14:00,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, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 80 [2021-12-17 09:14:00,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:00,837 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:14:00,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:00,872 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:14:00,872 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:14:00,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:00,908 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:14:01,978 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-17 09:14:01,979 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 178 treesize of output 137 [2021-12-17 09:14:02,025 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-12-17 09:14:02,025 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 94 treesize of output 88 [2021-12-17 09:14:02,038 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:14:02,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:02,040 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:14:03,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:14:03,183 INFO L354 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2021-12-17 09:14:03,184 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 117 treesize of output 57 [2021-12-17 09:14:03,205 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-17 09:14:03,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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:14:03,440 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:14:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:14:03,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:14:03,871 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1095 (_ BitVec 32)) (v_ArrVal_1092 (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_1094)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1092))) (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_1095)) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2021-12-17 09:14:03,922 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1095 (_ BitVec 32)) (v_ArrVal_1092 (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_1094)) (.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1092))) (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_1095)) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2021-12-17 09:14:03,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1095 (_ BitVec 32)) (v_ArrVal_1092 (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_1094)) (.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1092))) (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_1095)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))) is different from false [2021-12-17 09:14:04,654 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:14:04,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716285979] [2021-12-17 09:14:04,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716285979] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:14:04,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1791500174] [2021-12-17 09:14:04,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:14:04,654 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:14:04,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:14:04,655 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:14:04,656 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:14:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:14:04,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 87 conjunts are in the unsatisfiable core [2021-12-17 09:14:04,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:14:05,226 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:05,366 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:14:05,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:05,660 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:14:05,851 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:14:05,855 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:06,331 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:14:06,332 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:06,347 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:14:06,523 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:14:06,534 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:06,539 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:14:07,350 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:14:07,350 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:14:07,364 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:14:07,364 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:14:07,372 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:07,380 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:14:07,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:07,717 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:14:07,717 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:14:07,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:07,736 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:14:07,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:07,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:07,755 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:14:07,755 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:14:07,790 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:14:07,790 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:14:09,174 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-17 09:14:09,175 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:14:09,222 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-12-17 09:14:09,222 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:14:09,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:14:09,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:09,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, 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:14:10,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:14:10,162 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:14:10,162 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:14:10,183 INFO L354 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2021-12-17 09:14:10,184 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:14:10,634 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:14:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:14:10,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:14:10,694 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1182 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1180 (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_1180)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1179))) (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_1182)) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2021-12-17 09:14:10,746 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1182 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1180 (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_1180)) (.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1179))) (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_1182)) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2021-12-17 09:14:10,793 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1182 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1180 (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_1180)) (.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1179))) (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_1182)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))) is different from false [2021-12-17 09:14:11,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1791500174] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:14:11,556 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:14:11,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2021-12-17 09:14:11,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269671957] [2021-12-17 09:14:11,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:14:11,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-17 09:14:11,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:14:11,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-17 09:14:11,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2579, Unknown=17, NotChecked=642, Total=3422 [2021-12-17 09:14:11,558 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 47 states, 45 states have (on average 1.6) internal successors, (72), 37 states have internal predecessors, (72), 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:14:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:14:15,217 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2021-12-17 09:14:15,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-17 09:14:15,217 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 1.6) internal successors, (72), 37 states have internal predecessors, (72), 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 45 [2021-12-17 09:14:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:14:15,218 INFO L225 Difference]: With dead ends: 90 [2021-12-17 09:14:15,218 INFO L226 Difference]: Without dead ends: 88 [2021-12-17 09:14:15,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=283, Invalid=4145, Unknown=18, NotChecked=810, Total=5256 [2021-12-17 09:14:15,219 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 09:14:15,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 620 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 260 Invalid, 0 Unknown, 221 Unchecked, 0.6s Time] [2021-12-17 09:14:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-17 09:14:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2021-12-17 09:14:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 75 states have internal predecessors, (83), 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:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2021-12-17 09:14:15,232 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 45 [2021-12-17 09:14:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:14:15,233 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2021-12-17 09:14:15,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 1.6) internal successors, (72), 37 states have internal predecessors, (72), 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:14:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2021-12-17 09:14:15,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-17 09:14:15,234 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:14:15,234 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, 1, 1, 1, 1] [2021-12-17 09:14:15,238 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:14:15,448 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:14:15,638 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:14:15,639 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:14:15,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:14:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash 257826173, now seen corresponding path program 1 times [2021-12-17 09:14:15,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:14:15,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942274930] [2021-12-17 09:14:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:14:15,640 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:14:15,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:14:15,640 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:14:15,644 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:14:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:14:15,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 77 conjunts are in the unsatisfiable core [2021-12-17 09:14:15,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:14:15,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:15,911 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 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 09:14:15,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:15,944 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 17 treesize of output 13 [2021-12-17 09:14:16,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:16,107 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 09:14:16,107 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 28 treesize of output 45 [2021-12-17 09:14:16,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:16,259 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 27 treesize of output 21 [2021-12-17 09:14:16,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:16,473 INFO L354 Elim1Store]: treesize reduction 45, result has 45.1 percent of original size [2021-12-17 09:14:16,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 65 [2021-12-17 09:14:16,584 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:14:16,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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:14:17,089 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:14:17,089 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 97 treesize of output 48 [2021-12-17 09:14:17,097 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:14:17,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:17,115 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 0 case distinctions, treesize of input 38 treesize of output 30 [2021-12-17 09:14:17,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:17,378 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:14:17,379 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 103 treesize of output 83 [2021-12-17 09:14:17,426 INFO L354 Elim1Store]: treesize reduction 24, result has 54.7 percent of original size [2021-12-17 09:14:17,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 61 [2021-12-17 09:14:17,437 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 25 treesize of output 30 [2021-12-17 09:14:18,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:14:18,437 INFO L354 Elim1Store]: treesize reduction 127, result has 15.9 percent of original size [2021-12-17 09:14:18,437 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 163 treesize of output 93 [2021-12-17 09:14:18,477 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-12-17 09:14:18,478 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 304 treesize of output 252 [2021-12-17 09:14:19,356 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-17 09:14:19,357 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 296 treesize of output 172 [2021-12-17 09:14:19,858 INFO L354 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2021-12-17 09:14:19,858 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 147 treesize of output 49 [2021-12-17 09:14:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:14:19,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:14:20,398 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1260 (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_1260)) (.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:14:20,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1260 (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_1260)) (.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:14:20,459 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1260 (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_1260)) (.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:14:20,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1260 (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_1260)) (.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:14:20,890 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:14:20,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942274930] [2021-12-17 09:14:20,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942274930] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:14:20,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1287209565] [2021-12-17 09:14:20,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:14:20,890 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:14:20,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:14:20,892 INFO L229 MonitoredProcess]: Starting monitored process 21 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:14:20,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2021-12-17 09:14:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:14:21,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-17 09:14:21,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:14:21,468 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:21,948 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:22,065 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:14:22,065 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:22,220 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:14:22,809 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:14:22,809 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 57 treesize of output 28 [2021-12-17 09:14:22,815 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:22,821 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:14:22,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:22,997 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:14:22,998 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 63 treesize of output 55 [2021-12-17 09:14:23,026 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:14:23,026 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:14:23,081 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 09:14:23,081 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 14 treesize of output 20 [2021-12-17 09:14:23,091 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:14:24,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:24,341 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:14:24,396 INFO L354 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2021-12-17 09:14:24,397 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 123 treesize of output 73 [2021-12-17 09:14:24,437 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-12-17 09:14:24,437 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 236 treesize of output 202 [2021-12-17 09:14:26,202 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 09:14:26,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, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 250 treesize of output 149 [2021-12-17 09:14:26,753 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-12-17 09:14:26,754 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 128 treesize of output 32 [2021-12-17 09:14:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:14:26,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:14:27,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1329 (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_1329)) (.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:14:27,100 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1329 (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_1329)) (.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:14:27,129 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1329 (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_1329)) (.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:14:27,149 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1329 (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_1329)) (.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:14:28,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1287209565] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:14:28,385 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:14:28,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 44 [2021-12-17 09:14:28,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887223894] [2021-12-17 09:14:28,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:14:28,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-17 09:14:28,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:14:28,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-17 09:14:28,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2298, Unknown=12, NotChecked=824, Total=3306 [2021-12-17 09:14:28,387 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 44 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 35 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:14:32,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:14:32,527 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2021-12-17 09:14:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-17 09:14:32,527 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 35 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2021-12-17 09:14:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:14:32,528 INFO L225 Difference]: With dead ends: 98 [2021-12-17 09:14:32,528 INFO L226 Difference]: Without dead ends: 93 [2021-12-17 09:14:32,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=319, Invalid=4393, Unknown=12, NotChecked=1128, Total=5852 [2021-12-17 09:14:32,529 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:14:32,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 476 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 168 Unchecked, 0.3s Time] [2021-12-17 09:14:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-17 09:14:32,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2021-12-17 09:14:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 79 states have internal predecessors, (86), 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:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2021-12-17 09:14:32,542 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 46 [2021-12-17 09:14:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:14:32,542 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2021-12-17 09:14:32,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 35 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:14:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2021-12-17 09:14:32,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-17 09:14:32,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:14:32,543 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1] [2021-12-17 09:14:32,555 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:14:32,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2021-12-17 09:14:32,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-17 09:14:32,952 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:14:32,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:14:32,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1284126779, now seen corresponding path program 2 times [2021-12-17 09:14:32,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:14:32,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270277251] [2021-12-17 09:14:32,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:14:32,953 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:14:32,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:14:32,954 INFO L229 MonitoredProcess]: Starting monitored process 22 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:32,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-17 09:14:33,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:14:33,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:14:33,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 93 conjunts are in the unsatisfiable core [2021-12-17 09:14:33,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:14:33,261 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:33,282 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:33,441 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:14:33,442 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:33,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 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 09:14:33,643 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 09:14:33,644 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:14:33,733 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:33,746 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:14:34,096 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:14:34,096 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:14:34,102 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:34,108 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:14:38,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:38,404 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-17 09:14:38,405 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 91 treesize of output 68 [2021-12-17 09:14:38,457 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-17 09:14:38,458 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:14:38,469 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 33 treesize of output 39 [2021-12-17 09:14:39,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:39,412 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:14:39,477 INFO L354 Elim1Store]: treesize reduction 167, result has 15.7 percent of original size [2021-12-17 09:14:39,477 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 185 treesize of output 112 [2021-12-17 09:14:39,542 INFO L354 Elim1Store]: treesize reduction 168, result has 18.0 percent of original size [2021-12-17 09:14:39,543 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 8 new quantified variables, introduced 8 case distinctions, treesize of input 327 treesize of output 223 [2021-12-17 09:14:41,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:14:41,860 INFO L354 Elim1Store]: treesize reduction 135, result has 5.6 percent of original size [2021-12-17 09:14:41,860 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 9 new quantified variables, introduced 10 case distinctions, treesize of input 406 treesize of output 129 [2021-12-17 09:14:41,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:14:41,905 INFO L354 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2021-12-17 09:14:41,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 42 [2021-12-17 09:14:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:14:42,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:14:42,517 INFO L354 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2021-12-17 09:14:42,517 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 23 treesize of output 23 [2021-12-17 09:15:07,374 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:15:07,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270277251] [2021-12-17 09:15:07,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270277251] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:15:07,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1282497247] [2021-12-17 09:15:07,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:15:07,375 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:15:07,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:15:07,376 INFO L229 MonitoredProcess]: Starting monitored process 23 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,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2021-12-17 09:15:07,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:15:07,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:15:07,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 98 conjunts are in the unsatisfiable core [2021-12-17 09:15:07,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:15:10,003 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:10,753 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:11,303 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:15:11,304 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:15:11,517 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:15:11,534 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:12,409 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:15:12,409 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 76 treesize of output 39 [2021-12-17 09:15:12,417 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:15:12,417 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 1 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:15:12,422 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:15:12,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:12,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:12,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:12,741 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:15:12,741 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 1 case distinctions, treesize of input 35 treesize of output 41 [2021-12-17 09:15:12,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:12,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:12,753 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:15:12,766 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 09:15:12,766 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 92 treesize of output 69 [2021-12-17 09:15:12,793 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:15:12,794 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:15:15,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:15,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:15,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:15:15,666 INFO L354 Elim1Store]: treesize reduction 191, result has 14.0 percent of original size [2021-12-17 09:15:15,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 260 treesize of output 133 [2021-12-17 09:15:15,740 INFO L354 Elim1Store]: treesize reduction 172, result has 17.7 percent of original size [2021-12-17 09:15:15,740 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 8 new quantified variables, introduced 10 case distinctions, treesize of input 359 treesize of output 237 [2021-12-17 09:15:15,754 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 55 treesize of output 37 [2021-12-17 09:15:18,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:18,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:15:18,958 INFO L354 Elim1Store]: treesize reduction 105, result has 7.1 percent of original size [2021-12-17 09:15:18,958 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 9 new quantified variables, introduced 10 case distinctions, treesize of input 405 treesize of output 128 [2021-12-17 09:15:18,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:18,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:15:18,996 INFO L354 Elim1Store]: treesize reduction 24, result has 22.6 percent of original size [2021-12-17 09:15:18,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 42 [2021-12-17 09:15:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:15:19,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:15:20,906 INFO L354 Elim1Store]: treesize reduction 4, result has 98.7 percent of original size [2021-12-17 09:15:20,907 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 954 treesize of output 953 [2021-12-17 09:16:04,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1282497247] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:16:04,629 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:16:04,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31] total 53 [2021-12-17 09:16:04,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078644024] [2021-12-17 09:16:04,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:16:04,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-12-17 09:16:04,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:16:04,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-12-17 09:16:04,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=5563, Unknown=23, NotChecked=0, Total=5852 [2021-12-17 09:16:04,631 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 53 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 42 states have internal predecessors, (74), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:16:13,375 WARN L227 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 49 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 09:16:22,500 WARN L227 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 53 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:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:16:30,397 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2021-12-17 09:16:30,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-17 09:16:30,397 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 42 states have internal predecessors, (74), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2021-12-17 09:16:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:16:30,398 INFO L225 Difference]: With dead ends: 110 [2021-12-17 09:16:30,398 INFO L226 Difference]: Without dead ends: 102 [2021-12-17 09:16:30,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2496 ImplicationChecksByTransitivity, 101.7s TimeCoverageRelationStatistics Valid=451, Invalid=9426, Unknown=23, NotChecked=0, Total=9900 [2021-12-17 09:16:30,400 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:16:30,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 564 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 153 Invalid, 0 Unknown, 260 Unchecked, 0.3s Time] [2021-12-17 09:16:30,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-17 09:16:30,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-12-17 09:16:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.1) internal successors, (99), 91 states have internal predecessors, (99), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:16:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2021-12-17 09:16:30,414 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 48 [2021-12-17 09:16:30,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:16:30,415 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2021-12-17 09:16:30,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 42 states have internal predecessors, (74), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:16:30,415 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2021-12-17 09:16:30,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-17 09:16:30,416 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:16:30,416 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2021-12-17 09:16:30,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-17 09:16:30,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2021-12-17 09:16:30,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-17 09:16:30,824 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:16:30,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:16:30,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1153278983, now seen corresponding path program 2 times [2021-12-17 09:16:30,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:16:30,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33289860] [2021-12-17 09:16:30,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:16:30,825 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:16:30,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:16:30,826 INFO L229 MonitoredProcess]: Starting monitored process 24 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:30,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-17 09:16:31,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:16:31,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:16:31,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 99 conjunts are in the unsatisfiable core [2021-12-17 09:16:31,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:16:31,079 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:16:31,106 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:16:31,244 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:16:31,244 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:16:31,376 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:16:31,554 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 09:16:31,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 46 [2021-12-17 09:16:31,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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:16:31,714 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:16:32,242 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 09:16:32,243 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 97 treesize of output 48 [2021-12-17 09:16:32,250 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:16:32,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 28 treesize of output 22 [2021-12-17 09:16:32,392 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:16:32,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:32,546 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:16:32,546 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 103 treesize of output 83 [2021-12-17 09:16:32,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:32,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:32,556 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:16:32,591 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-17 09:16:32,591 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 3 case distinctions, treesize of input 45 treesize of output 49 [2021-12-17 09:16:33,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:16:34,021 INFO L354 Elim1Store]: treesize reduction 175, result has 9.3 percent of original size [2021-12-17 09:16:34,021 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 239 treesize of output 109 [2021-12-17 09:16:34,060 INFO L354 Elim1Store]: treesize reduction 120, result has 11.1 percent of original size [2021-12-17 09:16:34,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 236 treesize of output 157 [2021-12-17 09:16:34,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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:16:36,007 INFO L354 Elim1Store]: treesize reduction 66, result has 4.3 percent of original size [2021-12-17 09:16:36,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 304 treesize of output 162 [2021-12-17 09:16:36,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:16:36,556 INFO L354 Elim1Store]: treesize reduction 59, result has 6.3 percent of original size [2021-12-17 09:16:36,556 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 159 treesize of output 55 [2021-12-17 09:16:36,696 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:16:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 09:16:36,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:16:41,109 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:16:41,109 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1299 treesize of output 1300 [2021-12-17 09:16:41,247 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:16:41,247 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 3221 treesize of output 3224 [2021-12-17 09:16:41,272 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 1290 treesize of output 659 [2021-12-17 09:16:44,593 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:16:44,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33289860] [2021-12-17 09:16:44,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33289860] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:16:44,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [83144416] [2021-12-17 09:16:44,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:16:44,593 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:16:44,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:16:44,594 INFO L229 MonitoredProcess]: Starting monitored process 25 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:16:44,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2021-12-17 09:16:44,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:16:44,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:16:44,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 98 conjunts are in the unsatisfiable core [2021-12-17 09:16:44,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:16:46,185 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:16:46,796 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:16:46,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, 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:16:47,754 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:16:47,755 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 50 treesize of output 29 [2021-12-17 09:16:47,761 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:16:47,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:47,771 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 15 treesize of output 7 [2021-12-17 09:16:48,261 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:16:48,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:48,607 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 09:16:48,608 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 56 treesize of output 56 [2021-12-17 09:16:48,626 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 09:16:48,626 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:16:48,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:48,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:48,651 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:16:51,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:51,794 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 09:16:51,891 INFO L354 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2021-12-17 09:16:51,891 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 248 treesize of output 122 [2021-12-17 09:16:51,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:51,964 INFO L354 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2021-12-17 09:16:51,964 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 4 case distinctions, treesize of input 266 treesize of output 178 [2021-12-17 09:16:51,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:51,978 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 97 treesize of output 82 [2021-12-17 09:16:54,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:54,560 INFO L354 Elim1Store]: treesize reduction 27, result has 12.9 percent of original size [2021-12-17 09:16:54,560 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 310 treesize of output 115 [2021-12-17 09:16:54,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:54,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:16:54,589 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-17 09:16:54,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 33 [2021-12-17 09:16:55,763 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 09:16:55,763 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 22 treesize of output 14 [2021-12-17 09:16:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:16:55,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:17:01,111 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:17:01,112 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 13100 treesize of output 13103 [2021-12-17 09:17:50,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [83144416] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:17:50,245 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:17:50,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 58 [2021-12-17 09:17:50,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375889212] [2021-12-17 09:17:50,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:17:50,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-12-17 09:17:50,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:17:50,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-12-17 09:17:50,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=6777, Unknown=29, NotChecked=0, Total=7140 [2021-12-17 09:17:50,247 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 58 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 47 states have internal predecessors, (80), 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:17:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:17:59,404 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2021-12-17 09:17:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-17 09:17:59,405 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 47 states have internal predecessors, (80), 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 49 [2021-12-17 09:17:59,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:17:59,406 INFO L225 Difference]: With dead ends: 106 [2021-12-17 09:17:59,406 INFO L226 Difference]: Without dead ends: 104 [2021-12-17 09:17:59,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3176 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=557, Invalid=10969, Unknown=30, NotChecked=0, Total=11556 [2021-12-17 09:17:59,407 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 378 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:17:59,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 514 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 378 Unchecked, 0.4s Time] [2021-12-17 09:17:59,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-17 09:17:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-12-17 09:17:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 93 states have internal predecessors, (101), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:17:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2021-12-17 09:17:59,423 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 49 [2021-12-17 09:17:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:17:59,423 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2021-12-17 09:17:59,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 47 states have internal predecessors, (80), 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:17:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2021-12-17 09:17:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-17 09:17:59,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:17:59,424 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2021-12-17 09:17:59,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2021-12-17 09:17:59,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-12-17 09:17:59,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:17:59,831 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:17:59,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:17:59,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1391908617, now seen corresponding path program 1 times [2021-12-17 09:17:59,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:17:59,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791298240] [2021-12-17 09:17:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:17:59,832 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:17:59,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:17:59,833 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:17:59,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-17 09:17:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:17:59,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 09:18:00,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:18:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-17 09:18:00,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:18:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-17 09:18:00,287 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:18:00,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791298240] [2021-12-17 09:18:00,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791298240] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:18:00,287 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:18:00,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-12-17 09:18:00,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846328086] [2021-12-17 09:18:00,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:18:00,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 09:18:00,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:18:00,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 09:18:00,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:18:00,289 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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:18:00,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:18:00,389 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2021-12-17 09:18:00,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 09:18:00,390 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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 50 [2021-12-17 09:18:00,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:18:00,390 INFO L225 Difference]: With dead ends: 132 [2021-12-17 09:18:00,390 INFO L226 Difference]: Without dead ends: 102 [2021-12-17 09:18:00,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 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:18:00,391 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 61 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:18:00,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 279 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:18:00,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-17 09:18:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2021-12-17 09:18:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 76 states have internal predecessors, (86), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-17 09:18:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2021-12-17 09:18:00,402 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 50 [2021-12-17 09:18:00,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:18:00,402 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2021-12-17 09:18:00,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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:18:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2021-12-17 09:18:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-17 09:18:00,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:18:00,404 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:18:00,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-17 09:18:00,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:18:00,616 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:18:00,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:18:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash -240666655, now seen corresponding path program 3 times [2021-12-17 09:18:00,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:18:00,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137947974] [2021-12-17 09:18:00,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 09:18:00,617 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:18:00,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:18:00,618 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:18:00,618 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:18:00,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 09:18:00,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:18:00,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 09:18:00,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:18:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 09:18:01,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:18:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-17 09:18:01,305 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:18:01,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137947974] [2021-12-17 09:18:01,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137947974] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:18:01,305 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:18:01,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2021-12-17 09:18:01,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036188140] [2021-12-17 09:18:01,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:18:01,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 09:18:01,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:18:01,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 09:18:01,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-17 09:18:01,306 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2021-12-17 09:18:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:18:01,341 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2021-12-17 09:18:01,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 09:18:01,342 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2021-12-17 09:18:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:18:01,342 INFO L225 Difference]: With dead ends: 90 [2021-12-17 09:18:01,342 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 09:18:01,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-17 09:18:01,343 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:18:01,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:18:01,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 09:18:01,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 09:18:01,344 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:18:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 09:18:01,344 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2021-12-17 09:18:01,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:18:01,344 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 09:18:01,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2021-12-17 09:18:01,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 09:18:01,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 09:18:01,346 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 09:18:01,358 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:18:01,551 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:18:01,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 09:18:11,862 INFO L858 garLoopResultBuilder]: For program point L605-1(lines 605 607) no Hoare annotation was computed. [2021-12-17 09:18:11,863 INFO L854 garLoopResultBuilder]: At program point L605-3(lines 605 607) the Hoare annotation is: (let ((.cse13 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select |#memory_$Pointer$.base| .cse13))) (let ((.cse32 (select .cse12 (_ 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))) (.cse2 (= |ULTIMATE.start_main_~uneq~0#1| (_ bv5 32))) (.cse3 (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32))) (.cse5 (not (= .cse13 (_ bv1 32)))) (.cse6 (= (select (select |#memory_int| .cse13) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|)) (.cse4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (= (_ bv0 32) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (not (= .cse32 (_ bv1 32)))) (.cse9 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (_ bv4 32)) (_ bv0 32))) (.cse10 (not (= (_ bv0 32) .cse32))) (.cse11 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (bvadd |ULTIMATE.start_sll_append_~new_last~0#1.offset| (_ bv4 32))) (_ bv0 32))) (.cse14 (not (= (_ bv1 32) |ULTIMATE.start_sll_append_~new_last~0#1.base|))) (.cse20 (= (select (select |#memory_int| .cse32) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|)) (.cse22 (= (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_~uneq~0#1|)) (.cse23 (not (= (_ bv0 32) .cse13))) (.cse24 (= (_ bv0 32) |ULTIMATE.start_sll_append_~new_last~0#1.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 (_ bv0 32)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_sll_append_~last~0#1.base| (select .cse12 (bvadd .cse4 (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| .cse13) (_ bv4 32)) (_ bv0 32)) .cse14 (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 ((.cse17 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse18 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (.cse19 (bvadd .cse17 (_ bv4 32)))) (let ((.cse16 (select (select |#memory_$Pointer$.offset| .cse18) .cse19)) (.cse15 (select (select |#memory_$Pointer$.base| .cse18) .cse19))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= .cse15 |node_create_~temp~0#1.base|)) (= .cse16 (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| .cse15) (_ bv4 32)) (_ bv0 32)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= .cse17 (_ bv0 32)) (= |ULTIMATE.start_sll_append_~last~0#1.base| .cse15) (not (= .cse15 .cse18)) (= |ULTIMATE.start_sll_append_~last~0#1.offset| .cse16) (not (= |node_create_~temp~0#1.base| .cse18)) (= (select (select |#memory_$Pointer$.base| .cse15) (_ bv4 32)) (_ bv0 32))))))) .cse20 (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimIndex_149 (_ BitVec 32))) (let ((.cse21 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (and (bvult v_arrayElimIndex_149 |#StackHeapBarrier|) (bvult |ULTIMATE.start_sll_append_~new_last~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select (select |#memory_$Pointer$.base| .cse21) (_ bv4 32)) |#StackHeapBarrier|) (bvult .cse21 |#StackHeapBarrier|) (not (= (_ bv0 32) v_arrayElimIndex_149))))) .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (= |ULTIMATE.start_sll_append_~last~0#1.offset| .cse4) .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_sll_append_~last~0#1.base| .cse13) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (let ((.cse25 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse26 (select (select |#memory_$Pointer$.base| .cse25) (_ bv4 32)))) (and (not (= .cse25 |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse26 |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (bvult .cse26 |#StackHeapBarrier|))))) .cse11 .cse14 (exists ((|ULTIMATE.start_sll_append_~head#1.base| (_ BitVec 32)) (|ULTIMATE.start_sll_append_~head#1.offset| (_ BitVec 32))) (let ((.cse29 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse27 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (.cse28 (bvadd .cse29 (_ bv4 32)))) (let ((.cse30 (select (select |#memory_$Pointer$.base| .cse27) .cse28))) (and (= (select (select |#memory_$Pointer$.offset| .cse27) .cse28) (_ bv0 32)) (= |ULTIMATE.start_sll_append_~last~0#1.offset| .cse29) (= (select (select |#memory_$Pointer$.offset| .cse30) (_ bv4 32)) (_ bv0 32)) (= .cse29 (_ bv0 32)) (not (= .cse30 .cse27)) (= |ULTIMATE.start_sll_append_~last~0#1.base| .cse27) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (let ((.cse31 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| .cse31) (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|) (not (= |node_create_~temp~0#1.base| .cse31))))) (= (select (select |#memory_$Pointer$.base| .cse30) (_ bv4 32)) (_ bv0 32))))))) .cse20 (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_append_~new_last~0#1.base| |#StackHeapBarrier|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|))) .cse22 .cse23 .cse24)))))) [2021-12-17 09:18:11,863 INFO L854 garLoopResultBuilder]: At program point L634(lines 611 640) the Hoare annotation is: false [2021-12-17 09:18:11,867 INFO L858 garLoopResultBuilder]: For program point L601(lines 601 609) no Hoare annotation was computed. [2021-12-17 09:18:11,867 INFO L858 garLoopResultBuilder]: For program point L605-4(lines 605 607) no Hoare annotation was computed. [2021-12-17 09:18:11,867 INFO L861 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2021-12-17 09:18:11,867 INFO L858 garLoopResultBuilder]: For program point L622(lines 622 624) no Hoare annotation was computed. [2021-12-17 09:18:11,867 INFO L858 garLoopResultBuilder]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2021-12-17 09:18:11,868 INFO L854 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse18 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse13 (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (.cse17 (bvneg (select |#valid| (_ bv1 32)))) (.cse16 (bvneg (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))) (let ((.cse0 (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32))) (.cse2 (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32))) (.cse3 (bvneg .cse16)) (.cse6 (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|)) (_ bv1 1)))) (.cse7 (bvult |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|)) (.cse4 (bvneg .cse17)) (.cse8 (= (_ bv0 32) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32))) (.cse10 (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv1 32)))) (.cse11 (not (= (_ bv0 32) |ULTIMATE.start_sll_create_~head~0#1.base|))) (.cse14 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|)) (.cse12 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (select .cse18 .cse13)) (.cse15 (= (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| (_ bv1 32)) .cse0 .cse1 .cse2 (= (_ bv0 1) (bvadd .cse3 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse4 (_ bv1 1))) (= .cse5 (_ bv0 32)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= (select .cse12 .cse13) (_ bv0 32)) .cse14 .cse15) (and (= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32)) (= (_ bv0 1) (bvadd .cse16 (_ bv1 1))) .cse0 (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32)) .cse1 .cse14 (= (_ bv0 1) (bvadd .cse17 (_ bv1 1))) .cse2 .cse8 .cse9) (and (= (select (select |#memory_$Pointer$.offset| .cse5) (_ bv4 32)) (_ bv0 32)) .cse0 .cse1 .cse2 (= (_ bv0 1) (bvadd (bvneg .cse3) (_ bv1 1))) (= |ULTIMATE.start_sll_create_~len#1| (_ bv0 32)) .cse6 (bvult .cse5 |#StackHeapBarrier|) .cse7 (= (_ bv0 1) (bvadd (bvneg .cse4) (_ bv1 1))) .cse8 (= (select (select |#memory_int| .cse5) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) .cse9 .cse10 (= (select (select |#memory_$Pointer$.base| .cse5) (_ bv4 32)) (_ bv0 32)) .cse11 (not (= (_ bv0 32) .cse5)) .cse14 (= (select .cse12 (_ bv4 32)) (_ bv0 32)) (not (= (select .cse18 (_ bv4 32)) (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| .cse5))) (_ bv1 1))) .cse15)))) [2021-12-17 09:18:11,868 INFO L858 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2021-12-17 09:18:11,868 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 09:18:11,868 INFO L861 garLoopResultBuilder]: At program point L639(lines 611 640) the Hoare annotation is: true [2021-12-17 09:18:11,868 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 09:18:11,868 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 09:18:11,869 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 638) no Hoare annotation was computed. [2021-12-17 09:18:11,870 INFO L854 garLoopResultBuilder]: At program point L590(lines 583 591) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse2 (select .cse5 (_ bv4 32))) (.cse1 (select .cse5 (bvadd |ULTIMATE.start_sll_create_#res#1.offset| (_ bv4 32)))) (.cse3 (select .cse4 (_ bv4 32))) (.cse0 (select .cse4 (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))))) (and (= (select (select |#memory_$Pointer$.offset| .cse0) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| .cse1) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 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))) (= (_ bv0 32) |ULTIMATE.start_main_~#s~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| (_ bv1 32))))) (_ bv1 1))) (= (select (select |#memory_int| .cse0) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv1 32))) (= (select (select |#memory_$Pointer$.base| .cse0) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) |ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (_ bv0 32) .cse0)) (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_create_#res#1.base| (_ bv1 32))) (= (select (select |#memory_$Pointer$.offset| .cse1) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_int| .cse1) (_ 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)) (not (= (_ bv0 32) .cse1)) (not (= (_ bv0 32) |ULTIMATE.start_sll_create_#res#1.base|)) (not (= .cse2 (_ bv1 32))) (bvult |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (bvult .cse2 |#StackHeapBarrier|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| .cse1))) (_ bv1 1))) (bvult .cse3 |#StackHeapBarrier|) (= |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)) (not (= .cse3 (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| .cse0))) (_ bv1 1)))))) [2021-12-17 09:18:11,870 INFO L858 garLoopResultBuilder]: For program point L619(lines 619 632) no Hoare annotation was computed. [2021-12-17 09:18:11,870 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))) (.cse5 (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32))) (.cse4 (bvneg (select |#valid| (_ bv1 32)))) (.cse0 (bvneg (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))) (.cse6 (= (_ bv0 32) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (= |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 (= (_ bv0 1) (bvadd .cse4 (_ bv1 1))) .cse5 .cse6 .cse7) (let ((.cse8 (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (and (= |ULTIMATE.start_sll_create_~len#1| (_ bv1 32)) .cse1 .cse2 .cse5 (= (_ bv0 1) (bvadd (bvneg .cse4) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg .cse0) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse8) (_ 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|) .cse6 .cse7 (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv1 32))) (not (= (_ bv0 32) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse8) (_ 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:18:11,870 INFO L858 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2021-12-17 09:18:11,870 INFO L858 garLoopResultBuilder]: For program point L619-2(lines 611 640) no Hoare annotation was computed. [2021-12-17 09:18:11,870 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 09:18:11,870 INFO L858 garLoopResultBuilder]: For program point L599(lines 599 610) no Hoare annotation was computed. [2021-12-17 09:18:11,871 INFO L858 garLoopResultBuilder]: For program point L628(lines 628 630) no Hoare annotation was computed. [2021-12-17 09:18:11,871 INFO L858 garLoopResultBuilder]: For program point L620-1(lines 620 627) no Hoare annotation was computed. [2021-12-17 09:18:11,871 INFO L854 garLoopResultBuilder]: At program point L620-3(lines 620 627) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32))) (.cse2 (= |ULTIMATE.start_main_~uneq~0#1| (_ bv5 32))) (.cse3 (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32))) (.cse1 (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|)) (.cse4 (= |ULTIMATE.start_main_~ptr~0#1.offset| (_ bv0 32))) (.cse5 (let ((.cse76 (bvadd |ULTIMATE.start_main_~ptr~0#1.offset| (_ bv4 32)))) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) .cse76) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) .cse76) (_ bv0 32))))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_arrayElimIndex_149 (_ BitVec 32))) (let ((.cse10 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32))) (.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse11 (select |#memory_$Pointer$.offset| .cse9)) (.cse13 (bvadd .cse10 (_ bv4 32)))) (let ((.cse12 (select .cse11 .cse13))) (let ((.cse6 (select (select |#memory_$Pointer$.base| .cse9) .cse13)) (.cse7 (bvadd .cse12 (_ bv4 32)))) (let ((.cse8 (select (select |#memory_$Pointer$.base| .cse6) .cse7))) (and (= (select (select |#memory_$Pointer$.offset| .cse6) .cse7) (_ bv0 32)) (bvult .cse6 |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult .cse8 |#StackHeapBarrier|) (bvult .cse9 |#StackHeapBarrier|) (= .cse10 (_ bv0 32)) (not (= .cse9 .cse8)) (= (select (select |#memory_int| .cse8) (_ bv0 32)) |ULTIMATE.start_main_~uneq~0#1|) (bvult v_arrayElimIndex_149 |#StackHeapBarrier|) (= (select .cse11 (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse6) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse12) (not (= (_ bv0 32) v_arrayElimIndex_149)) (not (= (_ bv0 32) .cse9))))))))) (exists ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse19 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse20 (select |#memory_$Pointer$.offset| .cse14)) (.cse21 (bvadd .cse19 (_ bv4 32)))) (let ((.cse18 (select .cse20 .cse21))) (let ((.cse16 (select (select |#memory_$Pointer$.base| .cse14) .cse21)) (.cse17 (bvadd .cse18 (_ bv4 32)))) (let ((.cse15 (select (select |#memory_$Pointer$.base| .cse16) .cse17))) (and (not (= .cse14 .cse15)) (= (select (select |#memory_$Pointer$.offset| .cse16) .cse17) (_ bv0 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse16) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse18) (= .cse19 (_ bv0 32)) (bvult .cse15 |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse14)) (= (select .cse20 (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse16)) (= (select (select |#memory_$Pointer$.offset| .cse15) (_ bv4 32)) (_ bv0 32)) (not (= .cse16 .cse15)) (= (select (select |#memory_$Pointer$.base| .cse15) (_ bv4 32)) (_ bv0 32))))))))) (= |ULTIMATE.start_main_~count~0#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse26 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse28 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (bvadd .cse26 (_ bv4 32)))) (let ((.cse25 (select (select |#memory_$Pointer$.offset| .cse28) .cse23)) (.cse22 (select |#memory_$Pointer$.base| .cse28))) (let ((.cse27 (select .cse22 (_ bv4 32))) (.cse29 (bvadd .cse25 (_ bv4 32)))) (let ((.cse24 (select (select |#memory_$Pointer$.base| .cse27) .cse29))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select .cse22 .cse23)) (= (select (select |#memory_int| .cse24) (_ bv0 32)) |ULTIMATE.start_main_~uneq~0#1|) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse25) (= .cse26 (_ bv0 32)) (bvult .cse24 |#StackHeapBarrier|) (not (= (_ bv0 32) .cse24)) (not (= (_ bv0 32) .cse27)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse28)) (not (= .cse27 .cse24)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse27)) (= (select (select |#memory_$Pointer$.offset| .cse27) .cse29) (_ bv0 32)) (= .cse25 (_ bv0 32)) (not (= .cse28 .cse24)) (not (= (_ bv0 32) .cse28)))))))))) (and .cse0 .cse2 .cse3 (= |ULTIMATE.start_main_~count~0#1| (_ bv2 32)) (exists ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse33 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse36 (select |#memory_$Pointer$.offset| .cse30)) (.cse38 (bvadd .cse33 (_ bv4 32)))) (let ((.cse35 (select .cse36 .cse38))) (let ((.cse34 (select (select |#memory_$Pointer$.base| .cse30) .cse38)) (.cse37 (bvadd .cse35 (_ bv4 32)))) (let ((.cse32 (select (select |#memory_$Pointer$.offset| .cse34) .cse37)) (.cse31 (select (select |#memory_$Pointer$.base| .cse34) .cse37))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse30 .cse31)) (= .cse32 (_ bv0 32)) (= .cse33 (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| .cse34) .cse35)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse31) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse30)) (bvult .cse31 |#StackHeapBarrier|) (= (select .cse36 (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse34)) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse32) (= (select (select |#memory_$Pointer$.offset| .cse31) (_ bv4 32)) (_ bv0 32)) (not (= .cse34 .cse31)) (= (select (select |#memory_$Pointer$.base| .cse31) (_ bv4 32)) (_ bv0 32))))))))) (exists ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|#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|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse40 (select (select |#memory_$Pointer$.base| .cse41) (_ bv4 32)))) (let ((.cse39 (select (select |#memory_$Pointer$.base| .cse40) (_ bv4 32)))) (and (bvult .cse39 |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse40 .cse39)) (not (= (_ bv0 32) .cse40)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse41)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse40)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse39) (= (select (select |#memory_int| .cse39) (_ bv0 32)) |ULTIMATE.start_main_~uneq~0#1|) (not (= (_ bv0 32) .cse39)) (not (= .cse41 .cse39)) (not (= (_ bv0 32) .cse41))))))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse45 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32))) (.cse46 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse48 (select |#memory_$Pointer$.offset| .cse46)) (.cse50 (bvadd .cse45 (_ bv4 32)))) (let ((.cse47 (select .cse48 .cse50))) (let ((.cse43 (select (select |#memory_$Pointer$.base| .cse46) .cse50)) (.cse49 (bvadd .cse47 (_ bv4 32)))) (let ((.cse42 (select (select |#memory_$Pointer$.offset| .cse43) .cse49)) (.cse44 (select (select |#memory_$Pointer$.base| .cse43) .cse49))) (and (= .cse42 (_ bv0 32)) (not (= .cse43 .cse44)) (bvult .cse43 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse42) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult .cse44 |#StackHeapBarrier|) (= .cse45 (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| .cse44) (_ bv4 32)) (_ bv0 32)) (not (= .cse46 .cse44)) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| .cse43) .cse47)) (= (select .cse48 (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse44) (= (select (select |#memory_$Pointer$.base| .cse44) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) .cse46)))))))))) (and .cse0 .cse2 .cse3 .cse1 .cse4 (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 ((.cse51 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse53 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse52 (select (select |#memory_$Pointer$.base| .cse51) (_ bv4 32)))) (and (not (= .cse51 |node_create_~temp~0#1.base|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse51)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse52)) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse53) (= (select (select |#memory_$Pointer$.offset| .cse51) (_ bv4 32)) (_ bv0 32)) (= .cse53 (_ bv0 32)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse51) (not (= .cse52 |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (select (select |#memory_int| .cse52) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (not (= .cse51 .cse52)))))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse57 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32))) (.cse58 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse59 (select |#memory_$Pointer$.offset| .cse58)) (.cse60 (bvadd .cse57 (_ bv4 32)))) (let ((.cse54 (select (select |#memory_$Pointer$.base| .cse58) .cse60)) (.cse55 (bvadd (select .cse59 .cse60) (_ bv4 32)))) (let ((.cse56 (select (select |#memory_$Pointer$.base| .cse54) .cse55))) (and (= (select (select |#memory_$Pointer$.offset| .cse54) .cse55) (_ bv0 32)) (not (= .cse54 .cse56)) (bvult .cse54 |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult .cse56 |#StackHeapBarrier|) (= .cse57 (_ bv0 32)) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse57) (not (= .cse58 .cse56)) (= (select (select |#memory_$Pointer$.offset| .cse56) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse58) (= (select .cse59 (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| .cse56) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) .cse58)))))))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_arrayElimIndex_149 (_ BitVec 32))) (let ((.cse65 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32))) (.cse64 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse66 (select |#memory_$Pointer$.offset| .cse64)) (.cse67 (bvadd .cse65 (_ bv4 32)))) (let ((.cse61 (select (select |#memory_$Pointer$.base| .cse64) .cse67)) (.cse62 (bvadd (select .cse66 .cse67) (_ bv4 32)))) (let ((.cse63 (select (select |#memory_$Pointer$.base| .cse61) .cse62))) (and (= (select (select |#memory_$Pointer$.offset| .cse61) .cse62) (_ bv0 32)) (bvult .cse61 |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult .cse63 |#StackHeapBarrier|) (bvult .cse64 |#StackHeapBarrier|) (= .cse65 (_ bv0 32)) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse65) (not (= .cse64 .cse63)) (= (select (select |#memory_int| .cse63) (_ bv0 32)) |ULTIMATE.start_main_~uneq~0#1|) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse64) (bvult v_arrayElimIndex_149 |#StackHeapBarrier|) (= (select .cse66 (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) .cse64)) (not (= (_ bv0 32) v_arrayElimIndex_149)))))))) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) .cse5 (exists ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse72 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse68 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse75 (bvadd .cse72 (_ bv4 32)))) (let ((.cse73 (select (select |#memory_$Pointer$.base| .cse68) .cse75)) (.cse74 (select |#memory_$Pointer$.offset| .cse68))) (let ((.cse69 (select (select |#memory_$Pointer$.base| .cse73) (bvadd (select .cse74 .cse75) (_ bv4 32))))) (and (not (= .cse68 .cse69)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (let ((.cse70 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse71 (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| .cse70) .cse71)) (bvadd (select (select |#memory_$Pointer$.offset| .cse70) .cse71) (_ bv4 32)))) |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse72) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse68) (= .cse72 (_ bv0 32)) (not (= .cse68 (_ bv1 32))) (not (= .cse73 (_ bv1 32))) (not (= (_ bv1 32) .cse69)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse68)) (not (= (_ bv0 32) .cse69)) (= (select .cse74 (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse73)) (not (= .cse73 .cse69))))))))))) [2021-12-17 09:18:11,872 INFO L858 garLoopResultBuilder]: For program point L620-4(lines 620 627) no Hoare annotation was computed. [2021-12-17 09:18:11,872 INFO L854 garLoopResultBuilder]: At program point L600(line 600) the Hoare annotation is: (let ((.cse8 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse7 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (.cse4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (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 ((.cse6 (select .cse9 (bvadd |ULTIMATE.start_sll_create_#res#1.offset| (_ bv4 32)))) (.cse2 (select .cse9 (_ bv4 32))) (.cse3 (select (select |#memory_$Pointer$.base| .cse1) (_ bv4 32))) (.cse0 (select (select |#memory_$Pointer$.base| .cse7) (bvadd .cse4 (_ bv4 32)))) (.cse5 (select .cse8 (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))))) (and (= |ULTIMATE.start_main_~data~0#1| (_ bv1 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))) (= (_ bv0 32) |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (not (= (_ bv0 32) |ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |ULTIMATE.start_sll_create_#res#1.base| (_ bv1 32))) (= (select (select |#memory_$Pointer$.base| .cse0) (_ bv4 32)) (_ bv0 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_create_#res#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| (_ bv5 32)) (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32)) (= (select (select |#memory_int| |ULTIMATE.start_sll_create_#res#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 32) |ULTIMATE.start_sll_create_#res#1.base|)) (not (= .cse1 (_ bv1 32))) (not (= .cse2 (_ bv1 32))) (bvult |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| .cse3) (_ bv4 32)) (_ bv0 32)) (= .cse4 (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| .cse5) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| .cse6) (_ bv4 32)) (_ bv0 32)) (bvult .cse3 |#StackHeapBarrier|) (bvult .cse5 |#StackHeapBarrier|) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| (_ bv1 32))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| .cse2))) (_ bv1 1))) (= (select (select |#memory_int| .cse5) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv1 32))) (= (select (select |#memory_$Pointer$.base| .cse5) (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) .cse5)) (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 32) .cse3)) (= (select (select |#memory_$Pointer$.offset| .cse6) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| .cse7)) (_ bv1 1))) (= (select (select |#memory_int| .cse6) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 32) .cse1)) (= (select (select |#memory_int| |ULTIMATE.start_sll_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_sll_append_~data#1| |ULTIMATE.start_main_~uneq~0#1|) (= |ULTIMATE.start_sll_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (_ bv0 32) .cse6)) (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| .cse1) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (not (= .cse3 (_ bv1 32))) (bvult .cse2 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| .cse1) (_ 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)) (= (select (select |#memory_int| .cse3) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| .cse0))) (_ bv1 1))) (not (= (select .cse8 (_ bv4 32)) (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| .cse5))) (_ bv1 1))) (bvult .cse1 |#StackHeapBarrier|)))) [2021-12-17 09:18:11,872 INFO L858 garLoopResultBuilder]: For program point L600-1(line 600) no Hoare annotation was computed. [2021-12-17 09:18:11,872 INFO L858 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2021-12-17 09:18:11,872 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2021-12-17 09:18:11,873 INFO L858 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2021-12-17 09:18:11,873 INFO L861 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2021-12-17 09:18:11,873 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))) (not (= (_ bv0 1) (bvadd (select |old(#valid)| (_ bv1 32)) (_ bv1 1)))) (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:18:11,873 INFO L858 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2021-12-17 09:18:11,873 INFO L858 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2021-12-17 09:18:11,880 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-17 09:18:11,881 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 09:18:11,887 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:18:11,890 INFO L158 Benchmark]: Toolchain (without parser) took 567747.63ms. Allocated memory was 60.8MB in the beginning and 117.4MB in the end (delta: 56.6MB). Free memory was 40.5MB in the beginning and 68.2MB in the end (delta: -27.8MB). Peak memory consumption was 79.1MB. Max. memory is 16.1GB. [2021-12-17 09:18:11,890 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 60.8MB. Free memory was 43.2MB in the beginning and 43.2MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 09:18:11,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.99ms. Allocated memory is still 60.8MB. Free memory was 40.2MB in the beginning and 35.6MB in the end (delta: 4.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-17 09:18:11,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.90ms. Allocated memory is still 60.8MB. Free memory was 35.4MB in the beginning and 33.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:18:11,891 INFO L158 Benchmark]: Boogie Preprocessor took 43.72ms. Allocated memory is still 60.8MB. Free memory was 33.1MB in the beginning and 31.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:18:11,891 INFO L158 Benchmark]: RCFGBuilder took 450.30ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 31.1MB in the beginning and 50.4MB in the end (delta: -19.2MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2021-12-17 09:18:11,891 INFO L158 Benchmark]: TraceAbstraction took 566767.48ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 50.0MB in the beginning and 68.2MB in the end (delta: -18.2MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2021-12-17 09:18:11,892 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.17ms. Allocated memory is still 60.8MB. Free memory was 43.2MB in the beginning and 43.2MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.99ms. Allocated memory is still 60.8MB. Free memory was 40.2MB in the beginning and 35.6MB in the end (delta: 4.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.90ms. Allocated memory is still 60.8MB. Free memory was 35.4MB in the beginning and 33.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.72ms. Allocated memory is still 60.8MB. Free memory was 33.1MB in the beginning and 31.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 450.30ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 31.1MB in the beginning and 50.4MB in the end (delta: -19.2MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * TraceAbstraction took 566767.48ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 50.0MB in the beginning and 68.2MB in the end (delta: -18.2MB). Peak memory consumption was 69.7MB. 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: 638]: 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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 566.7s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 64.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 318 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 315 mSDsluCounter, 5246 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1981 IncrementalHoareTripleChecker+Unchecked, 4801 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1811 IncrementalHoareTripleChecker+Invalid, 3910 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 445 mSDtfsCounter, 1811 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1650 GetRequests, 876 SyntacticMatches, 34 SemanticMatches, 740 ConstructedPredicates, 34 IntricatePredicates, 0 DeprecatedPredicates, 13820 ImplicationChecksByTransitivity, 289.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=14, InterpolantAutomatonStates: 263, 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, 16 MinimizatonAttempts, 67 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 27 PreInvPairs, 41 NumberOfFragments, 4742 HoareAnnotationTreeSize, 27 FomulaSimplifications, 62 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 7946 FormulaSimplificationTreeSizeReductionInter, 10.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 480.2s InterpolantComputationTime, 1065 NumberOfCodeBlocks, 1065 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1166 ConstructedInterpolants, 337 QuantifiedInterpolants, 46582 SizeOfPredicates, 590 NumberOfNonLiveVariables, 5811 ConjunctsInSsa, 1443 ConjunctsInUnsatCore, 29 InterpolantComputations, 3 PerfectInterpolantSequences, 374/705 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: 611]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - 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:18:12,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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