./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/dll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:12:01,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:12:01,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:12:01,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:12:01,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:12:01,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:12:01,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:12:01,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:12:01,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:12:01,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:12:01,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:12:01,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:12:01,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:12:01,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:12:01,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:12:01,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:12:01,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:12:01,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:12:01,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:12:01,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:12:01,914 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:12:01,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:12:01,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:12:01,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:12:01,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:12:01,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:12:01,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:12:01,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:12:01,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:12:01,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:12:01,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:12:01,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:12:01,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:12:01,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:12:01,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:12:01,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:12:01,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:12:01,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:12:01,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:12:01,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:12:01,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:12:01,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:12:01,924 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:12:01,947 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:12:01,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:12:01,948 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:12:01,948 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:12:01,949 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:12:01,949 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:12:01,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:12:01,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:12:01,950 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:12:01,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:12:01,951 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:12:01,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:12:01,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:12:01,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:12:01,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:12:01,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:12:01,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:12:01,952 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:12:01,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:12:01,952 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:12:01,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:12:01,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:12:01,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:12:01,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:12:01,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:12:01,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:12:01,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:12:01,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:12:01,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:12:01,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:12:01,953 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:12:01,954 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:12:01,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:12:01,954 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 -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2022-07-13 15:12:02,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:12:02,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:12:02,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:12:02,157 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:12:02,158 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:12:02,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-07-13 15:12:02,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b955bed4/85f4f0987ee0473c8b30d09bfebcfa29/FLAG4af90214a [2022-07-13 15:12:02,552 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:12:02,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-07-13 15:12:02,572 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b955bed4/85f4f0987ee0473c8b30d09bfebcfa29/FLAG4af90214a [2022-07-13 15:12:02,946 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b955bed4/85f4f0987ee0473c8b30d09bfebcfa29 [2022-07-13 15:12:02,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:12:02,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:12:02,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:12:02,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:12:02,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:12:02,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:12:02" (1/1) ... [2022-07-13 15:12:02,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc3d001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:02, skipping insertion in model container [2022-07-13 15:12:02,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:12:02" (1/1) ... [2022-07-13 15:12:02,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:12:02,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:12:03,232 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/dll2n_append_equal.i[24333,24346] [2022-07-13 15:12:03,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:12:03,242 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:12:03,276 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/dll2n_append_equal.i[24333,24346] [2022-07-13 15:12:03,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:12:03,301 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:12:03,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:03 WrapperNode [2022-07-13 15:12:03,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:12:03,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:12:03,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:12:03,304 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:12:03,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:03" (1/1) ... [2022-07-13 15:12:03,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:03" (1/1) ... [2022-07-13 15:12:03,349 INFO L137 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2022-07-13 15:12:03,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:12:03,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:12:03,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:12:03,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:12:03,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:03" (1/1) ... [2022-07-13 15:12:03,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:03" (1/1) ... [2022-07-13 15:12:03,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:03" (1/1) ... [2022-07-13 15:12:03,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:03" (1/1) ... [2022-07-13 15:12:03,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:03" (1/1) ... [2022-07-13 15:12:03,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:03" (1/1) ... [2022-07-13 15:12:03,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:03" (1/1) ... [2022-07-13 15:12:03,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:12:03,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:12:03,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:12:03,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:12:03,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:03" (1/1) ... [2022-07-13 15:12:03,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:12:03,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:03,403 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:12:03,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:12:03,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 15:12:03,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 15:12:03,428 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-13 15:12:03,428 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-13 15:12:03,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:12:03,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:12:03,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 15:12:03,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:12:03,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:12:03,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:12:03,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 15:12:03,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:12:03,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:12:03,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:12:03,538 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:12:03,539 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:12:03,687 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:12:03,691 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:12:03,692 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 15:12:03,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:12:03 BoogieIcfgContainer [2022-07-13 15:12:03,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:12:03,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:12:03,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:12:03,708 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:12:03,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:12:02" (1/3) ... [2022-07-13 15:12:03,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79850d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:12:03, skipping insertion in model container [2022-07-13 15:12:03,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:03" (2/3) ... [2022-07-13 15:12:03,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79850d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:12:03, skipping insertion in model container [2022-07-13 15:12:03,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:12:03" (3/3) ... [2022-07-13 15:12:03,711 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2022-07-13 15:12:03,720 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:12:03,720 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:12:03,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:12:03,757 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ccf8fd9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@e4424f0 [2022-07-13 15:12:03,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:12:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 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) [2022-07-13 15:12:03,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 15:12:03,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:03,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:12:03,771 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:03,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:03,774 INFO L85 PathProgramCache]: Analyzing trace with hash 308507763, now seen corresponding path program 1 times [2022-07-13 15:12:03,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:03,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480313105] [2022-07-13 15:12:03,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:03,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:03,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 15:12:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:12:04,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:04,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480313105] [2022-07-13 15:12:04,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480313105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:12:04,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:12:04,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:12:04,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426244092] [2022-07-13 15:12:04,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:12:04,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:12:04,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:04,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:12:04,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:12:04,034 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 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) [2022-07-13 15:12:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:04,074 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-07-13 15:12:04,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:12:04,076 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 [2022-07-13 15:12:04,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:04,080 INFO L225 Difference]: With dead ends: 57 [2022-07-13 15:12:04,080 INFO L226 Difference]: Without dead ends: 26 [2022-07-13 15:12:04,082 INFO L412 NwaCegarLoop]: 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 [2022-07-13 15:12:04,084 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 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 [2022-07-13 15:12:04,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:12:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-13 15:12:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-13 15:12:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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) [2022-07-13 15:12:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-13 15:12:04,106 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2022-07-13 15:12:04,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:04,106 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-13 15:12:04,106 INFO L496 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) [2022-07-13 15:12:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-07-13 15:12:04,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 15:12:04,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:04,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:12:04,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:12:04,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:04,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2109805219, now seen corresponding path program 1 times [2022-07-13 15:12:04,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:04,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366932406] [2022-07-13 15:12:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:04,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:04,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 15:12:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:12:04,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:04,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366932406] [2022-07-13 15:12:04,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366932406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:12:04,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:12:04,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:12:04,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720945077] [2022-07-13 15:12:04,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:12:04,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:12:04,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:04,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:12:04,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:12:04,174 INFO L87 Difference]: Start difference. First operand 26 states and 32 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) [2022-07-13 15:12:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:04,204 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-07-13 15:12:04,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:12:04,205 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 [2022-07-13 15:12:04,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:04,205 INFO L225 Difference]: With dead ends: 50 [2022-07-13 15:12:04,206 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 15:12:04,206 INFO L412 NwaCegarLoop]: 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 [2022-07-13 15:12:04,207 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 70 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 [2022-07-13 15:12:04,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 70 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:12:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 15:12:04,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-07-13 15:12:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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) [2022-07-13 15:12:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-07-13 15:12:04,221 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2022-07-13 15:12:04,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:04,221 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-07-13 15:12:04,222 INFO L496 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) [2022-07-13 15:12:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-07-13 15:12:04,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:12:04,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:04,223 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:12:04,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:12:04,223 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:04,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:04,223 INFO L85 PathProgramCache]: Analyzing trace with hash 493100305, now seen corresponding path program 1 times [2022-07-13 15:12:04,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:04,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310491830] [2022-07-13 15:12:04,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:04,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:04,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:04,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 15:12:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:12:04,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:04,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310491830] [2022-07-13 15:12:04,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310491830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:12:04,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:12:04,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:12:04,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195357226] [2022-07-13 15:12:04,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:12:04,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:12:04,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:04,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:12:04,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:12:04,355 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-07-13 15:12:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:04,394 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-07-13 15:12:04,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:12:04,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) Word has length 27 [2022-07-13 15:12:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:04,396 INFO L225 Difference]: With dead ends: 55 [2022-07-13 15:12:04,396 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 15:12:04,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:12:04,397 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 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 [2022-07-13 15:12:04,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:12:04,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 15:12:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-07-13 15:12:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:12:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-07-13 15:12:04,405 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2022-07-13 15:12:04,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:04,405 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-07-13 15:12:04,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-07-13 15:12:04,405 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-07-13 15:12:04,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:12:04,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:04,406 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:12:04,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:12:04,407 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:04,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:04,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247597, now seen corresponding path program 1 times [2022-07-13 15:12:04,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:04,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303833724] [2022-07-13 15:12:04,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:04,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:04,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:04,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 15:12:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:12:04,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:04,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303833724] [2022-07-13 15:12:04,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303833724] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:04,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738996444] [2022-07-13 15:12:04,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:04,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:04,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:04,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:12:04,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 15:12:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:04,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:12:04,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:12:04,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:12:04,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738996444] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:12:04,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:12:04,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-07-13 15:12:04,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212811502] [2022-07-13 15:12:04,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:04,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:12:04,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:04,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:12:04,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:12:04,738 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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) [2022-07-13 15:12:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:04,781 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2022-07-13 15:12:04,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:12:04,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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 27 [2022-07-13 15:12:04,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:04,783 INFO L225 Difference]: With dead ends: 51 [2022-07-13 15:12:04,784 INFO L226 Difference]: Without dead ends: 32 [2022-07-13 15:12:04,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:12:04,786 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:04,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:12:04,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-13 15:12:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-13 15:12:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:12:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-07-13 15:12:04,795 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2022-07-13 15:12:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:04,796 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-07-13 15:12:04,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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) [2022-07-13 15:12:04,796 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-07-13 15:12:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:12:04,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:04,798 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:12:04,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 15:12:05,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:05,031 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:05,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:05,031 INFO L85 PathProgramCache]: Analyzing trace with hash -292922041, now seen corresponding path program 1 times [2022-07-13 15:12:05,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:05,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835243537] [2022-07-13 15:12:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:05,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:05,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:05,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:05,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 15:12:05,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:05,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835243537] [2022-07-13 15:12:05,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835243537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:12:05,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:12:05,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 15:12:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607054525] [2022-07-13 15:12:05,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:12:05,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 15:12:05,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:05,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 15:12:05,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:12:05,171 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:12:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:05,250 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-13 15:12:05,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 15:12:05,250 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-07-13 15:12:05,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:05,251 INFO L225 Difference]: With dead ends: 45 [2022-07-13 15:12:05,251 INFO L226 Difference]: Without dead ends: 42 [2022-07-13 15:12:05,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:12:05,252 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 61 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:05,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 130 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:12:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-13 15:12:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-07-13 15:12:05,256 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) [2022-07-13 15:12:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-07-13 15:12:05,257 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 37 [2022-07-13 15:12:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:05,257 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-07-13 15:12:05,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:12:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-07-13 15:12:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:12:05,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:05,258 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:12:05,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 15:12:05,258 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:05,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:05,259 INFO L85 PathProgramCache]: Analyzing trace with hash -292920367, now seen corresponding path program 1 times [2022-07-13 15:12:05,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:05,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472648510] [2022-07-13 15:12:05,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:05,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:05,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:05,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:05,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:12:05,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:05,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472648510] [2022-07-13 15:12:05,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472648510] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:05,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283100537] [2022-07-13 15:12:05,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:05,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:05,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:05,463 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:12:05,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 15:12:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:05,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-13 15:12:05,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:05,751 INFO L390 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 [2022-07-13 15:12:05,787 WARN L855 $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_652 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_652))))) is different from true [2022-07-13 15:12:05,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:05,806 INFO L390 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 [2022-07-13 15:12:05,825 INFO L390 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 [2022-07-13 15:12:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-07-13 15:12:05,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:05,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int)) (|v_node_create_~temp~0#1.base_13| Int)) (or (not (< |v_node_create_~temp~0#1.base_13| |c_#StackHeapBarrier|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_13| v_ArrVal_655) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0)))) is different from false [2022-07-13 15:12:05,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283100537] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:05,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:05,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-07-13 15:12:05,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286196317] [2022-07-13 15:12:05,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:05,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 15:12:05,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:05,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 15:12:05,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=525, Unknown=2, NotChecked=94, Total=702 [2022-07-13 15:12:05,878 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 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) [2022-07-13 15:12:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:06,115 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-07-13 15:12:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:12:06,116 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 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 37 [2022-07-13 15:12:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:06,116 INFO L225 Difference]: With dead ends: 39 [2022-07-13 15:12:06,116 INFO L226 Difference]: Without dead ends: 32 [2022-07-13 15:12:06,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=856, Unknown=2, NotChecked=122, Total=1122 [2022-07-13 15:12:06,117 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:06,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 214 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 261 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-07-13 15:12:06,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-13 15:12:06,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-13 15:12:06,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:12:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-07-13 15:12:06,122 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2022-07-13 15:12:06,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:06,122 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-07-13 15:12:06,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 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) [2022-07-13 15:12:06,122 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-07-13 15:12:06,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 15:12:06,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:06,123 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-13 15:12:06,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:12:06,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-13 15:12:06,341 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:06,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:06,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1499731437, now seen corresponding path program 1 times [2022-07-13 15:12:06,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:06,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494249921] [2022-07-13 15:12:06,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:06,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:06,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:06,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:06,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:12:06,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:06,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494249921] [2022-07-13 15:12:06,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494249921] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:06,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104507273] [2022-07-13 15:12:06,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:06,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:06,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:06,646 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:12:06,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 15:12:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:06,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 15:12:06,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:06,911 INFO L390 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 [2022-07-13 15:12:06,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:06,968 INFO L390 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 [2022-07-13 15:12:07,074 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-07-13 15:12:07,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-07-13 15:12:07,091 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-13 15:12:07,091 INFO L390 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 32 treesize of output 42 [2022-07-13 15:12:07,106 INFO L390 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 9 treesize of output 5 [2022-07-13 15:12:07,109 INFO L390 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 [2022-07-13 15:12:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:12:07,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:07,262 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| Int) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_894 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| v_ArrVal_899))) (let ((.cse1 (select .cse0 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse2 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select (select (store (store .cse0 |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse1 .cse2 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| v_ArrVal_894) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| |c_#StackHeapBarrier|)) (not (= (select .cse1 .cse2) 0)))))) is different from false [2022-07-13 15:12:07,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104507273] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:07,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:07,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2022-07-13 15:12:07,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419868500] [2022-07-13 15:12:07,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:07,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-13 15:12:07,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:07,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-13 15:12:07,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1077, Unknown=4, NotChecked=66, Total=1260 [2022-07-13 15:12:07,265 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 15:12:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:07,832 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-07-13 15:12:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 15:12:07,832 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2022-07-13 15:12:07,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:07,833 INFO L225 Difference]: With dead ends: 52 [2022-07-13 15:12:07,833 INFO L226 Difference]: Without dead ends: 49 [2022-07-13 15:12:07,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=246, Invalid=2106, Unknown=4, NotChecked=94, Total=2450 [2022-07-13 15:12:07,834 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 78 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:07,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 205 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 378 Invalid, 0 Unknown, 3 Unchecked, 0.2s Time] [2022-07-13 15:12:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-13 15:12:07,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2022-07-13 15:12:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:12:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-13 15:12:07,837 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 40 [2022-07-13 15:12:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:07,838 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-13 15:12:07,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 15:12:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-13 15:12:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 15:12:07,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:07,838 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-13 15:12:07,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 15:12:08,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:08,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:08,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:08,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1499729763, now seen corresponding path program 1 times [2022-07-13 15:12:08,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:08,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243329350] [2022-07-13 15:12:08,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:08,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:08,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:08,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:08,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:12:08,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:08,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243329350] [2022-07-13 15:12:08,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243329350] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:08,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231615502] [2022-07-13 15:12:08,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:08,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:08,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:08,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:12:08,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 15:12:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:09,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-13 15:12:09,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:09,158 INFO L390 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 [2022-07-13 15:12:09,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:09,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:09,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:09,425 INFO L390 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 21 treesize of output 26 [2022-07-13 15:12:09,478 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 15:12:09,478 INFO L390 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 [2022-07-13 15:12:09,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:12:09,543 INFO L390 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 24 treesize of output 20 [2022-07-13 15:12:09,630 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:12:09,630 INFO L390 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 44 treesize of output 43 [2022-07-13 15:12:09,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:12:09,859 INFO L390 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 51 treesize of output 22 [2022-07-13 15:12:09,867 INFO L390 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 [2022-07-13 15:12:10,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:10,024 INFO L390 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 [2022-07-13 15:12:10,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:10,034 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:12:10,034 INFO L390 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 57 treesize of output 49 [2022-07-13 15:12:10,048 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:12:10,048 INFO L390 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 [2022-07-13 15:12:10,099 INFO L390 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 [2022-07-13 15:12:10,151 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:12:10,151 INFO L390 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 15 [2022-07-13 15:12:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:12:10,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:10,289 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_19| Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (or (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_1153))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_19| v_ArrVal_1154) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) 0)) (not (< |v_node_create_~temp~0#1.base_19| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_19|) 0)))) is different from false [2022-07-13 15:12:10,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231615502] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:10,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:10,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 46 [2022-07-13 15:12:10,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862047743] [2022-07-13 15:12:10,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:10,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-13 15:12:10,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:10,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-13 15:12:10,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2126, Unknown=5, NotChecked=92, Total=2352 [2022-07-13 15:12:10,292 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 46 states, 44 states have (on average 1.5) internal successors, (66), 38 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) [2022-07-13 15:12:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:11,666 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-07-13 15:12:11,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 15:12:11,667 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.5) internal successors, (66), 38 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 40 [2022-07-13 15:12:11,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:11,669 INFO L225 Difference]: With dead ends: 61 [2022-07-13 15:12:11,669 INFO L226 Difference]: Without dead ends: 36 [2022-07-13 15:12:11,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=295, Invalid=3609, Unknown=6, NotChecked=122, Total=4032 [2022-07-13 15:12:11,671 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:11,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 383 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 657 Invalid, 0 Unknown, 49 Unchecked, 0.4s Time] [2022-07-13 15:12:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-13 15:12:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-07-13 15:12:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:12:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-07-13 15:12:11,675 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 40 [2022-07-13 15:12:11,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:11,691 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-07-13 15:12:11,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.5) internal successors, (66), 38 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) [2022-07-13 15:12:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-07-13 15:12:11,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-13 15:12:11,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:11,693 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:12:11,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 15:12:11,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:11,893 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:11,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:11,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1422189688, now seen corresponding path program 1 times [2022-07-13 15:12:11,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:11,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641185895] [2022-07-13 15:12:11,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:11,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:12,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:12,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:12,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:12:13,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:13,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641185895] [2022-07-13 15:12:13,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641185895] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:13,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6607436] [2022-07-13 15:12:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:13,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:13,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:13,008 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:12:13,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 15:12:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:13,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 136 conjunts are in the unsatisfiable core [2022-07-13 15:12:13,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:13,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:12:13,431 INFO L390 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 [2022-07-13 15:12:13,546 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:12:13,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 15:12:13,690 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:12:13,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:12:13,741 INFO L390 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 [2022-07-13 15:12:13,830 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-13 15:12:13,830 INFO L390 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 5 case distinctions, treesize of input 22 treesize of output 33 [2022-07-13 15:12:13,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:13,906 INFO L390 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 24 treesize of output 20 [2022-07-13 15:12:13,920 INFO L390 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 [2022-07-13 15:12:13,990 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:12:13,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-13 15:12:13,993 INFO L390 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 [2022-07-13 15:12:14,272 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:12:14,272 INFO L390 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 33 [2022-07-13 15:12:14,279 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:12:14,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-07-13 15:12:14,284 INFO L390 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 [2022-07-13 15:12:14,287 INFO L390 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 [2022-07-13 15:12:14,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:14,444 INFO L390 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 [2022-07-13 15:12:14,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:14,458 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:12:14,458 INFO L390 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 72 treesize of output 64 [2022-07-13 15:12:14,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:14,464 INFO L390 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 18 treesize of output 20 [2022-07-13 15:12:14,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:14,508 INFO L356 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-07-13 15:12:14,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2022-07-13 15:12:14,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:12:15,019 INFO L356 Elim1Store]: treesize reduction 152, result has 16.0 percent of original size [2022-07-13 15:12:15,023 INFO L390 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 198 treesize of output 105 [2022-07-13 15:12:15,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:15,038 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:12:15,038 INFO L390 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 138 treesize of output 106 [2022-07-13 15:12:15,052 INFO L356 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2022-07-13 15:12:15,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2022-07-13 15:12:15,061 INFO L390 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 29 treesize of output 33 [2022-07-13 15:12:15,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:15,065 INFO L390 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 [2022-07-13 15:12:15,127 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:12:15,127 INFO L390 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 51 treesize of output 26 [2022-07-13 15:12:15,130 INFO L390 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 [2022-07-13 15:12:15,177 INFO L390 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 [2022-07-13 15:12:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:12:15,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:15,224 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1410 Int) (v_ArrVal_1408 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1413) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1410)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1409)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-13 15:12:15,432 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1410 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_11| Int) (v_ArrVal_1408 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_11| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_1414) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1413) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 v_ArrVal_1410)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 v_ArrVal_1409)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-13 15:12:15,450 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1410 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_11| Int) (v_ArrVal_1408 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_11| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1414) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1413) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 v_ArrVal_1410)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 v_ArrVal_1409)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select .cse1 .cse2) 0)))))) is different from false [2022-07-13 15:12:15,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1415 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| Int) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1410 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_11| Int) (v_ArrVal_1408 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1426)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1425))) (let ((.cse2 (select (select .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ 4 (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))))) (let ((.cse0 (select .cse3 .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_11| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1424) .cse2 v_ArrVal_1414) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1413) (select (select (store (store .cse3 .cse2 (store .cse0 .cse1 v_ArrVal_1410)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse2 (store (select .cse4 .cse2) .cse1 v_ArrVal_1409)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-07-13 15:12:15,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6607436] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:15,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:15,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 55 [2022-07-13 15:12:15,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834014415] [2022-07-13 15:12:15,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:15,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-13 15:12:15,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:15,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-13 15:12:15,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3113, Unknown=5, NotChecked=460, Total=3782 [2022-07-13 15:12:15,627 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 55 states, 53 states have (on average 1.320754716981132) internal successors, (70), 46 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 15:12:17,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:17,445 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-07-13 15:12:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 15:12:17,446 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.320754716981132) internal successors, (70), 46 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2022-07-13 15:12:17,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:17,446 INFO L225 Difference]: With dead ends: 49 [2022-07-13 15:12:17,446 INFO L226 Difference]: Without dead ends: 47 [2022-07-13 15:12:17,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=408, Invalid=5005, Unknown=5, NotChecked=588, Total=6006 [2022-07-13 15:12:17,448 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 86 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:17,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 295 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 819 Invalid, 0 Unknown, 30 Unchecked, 0.5s Time] [2022-07-13 15:12:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-13 15:12:17,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-07-13 15:12:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:12:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-07-13 15:12:17,454 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 42 [2022-07-13 15:12:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:17,455 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-07-13 15:12:17,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.320754716981132) internal successors, (70), 46 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 15:12:17,455 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-07-13 15:12:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 15:12:17,455 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:17,455 INFO L195 NwaCegarLoop]: 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, 1] [2022-07-13 15:12:17,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 15:12:17,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:17,676 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:17,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash 924723017, now seen corresponding path program 1 times [2022-07-13 15:12:17,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:17,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607864378] [2022-07-13 15:12:17,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:17,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:18,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:18,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:18,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:12:18,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:18,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607864378] [2022-07-13 15:12:18,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607864378] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:18,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101309685] [2022-07-13 15:12:18,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:18,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:18,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:18,374 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:12:18,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 15:12:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:18,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-13 15:12:18,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:18,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:12:18,600 INFO L390 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 [2022-07-13 15:12:18,677 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:12:18,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 15:12:18,792 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:12:18,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:12:18,884 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-13 15:12:18,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-07-13 15:12:18,948 INFO L390 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 [2022-07-13 15:12:19,033 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:12:19,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-13 15:12:19,311 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:12:19,311 INFO L390 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 67 treesize of output 30 [2022-07-13 15:12:19,317 INFO L390 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 [2022-07-13 15:12:19,334 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:12:19,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-07-13 15:12:19,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:19,476 INFO L390 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 [2022-07-13 15:12:19,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:19,487 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:12:19,487 INFO L390 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 61 [2022-07-13 15:12:19,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:19,501 INFO L356 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-07-13 15:12:19,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2022-07-13 15:12:19,815 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-13 15:12:19,816 INFO L390 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 24 treesize of output 26 [2022-07-13 15:12:19,844 INFO L356 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2022-07-13 15:12:19,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 60 [2022-07-13 15:12:19,872 INFO L356 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-07-13 15:12:19,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 102 [2022-07-13 15:12:19,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:19,882 INFO L390 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 18 treesize of output 20 [2022-07-13 15:12:19,895 INFO L390 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 38 treesize of output 26 [2022-07-13 15:12:19,956 INFO L390 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 [2022-07-13 15:12:20,045 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:12:20,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 23 [2022-07-13 15:12:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:12:20,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:20,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101309685] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:20,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:20,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 50 [2022-07-13 15:12:20,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530758032] [2022-07-13 15:12:20,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:20,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 15:12:20,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:20,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 15:12:20,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2973, Unknown=15, NotChecked=0, Total=3192 [2022-07-13 15:12:20,574 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 50 states, 48 states have (on average 1.5) internal successors, (72), 41 states have internal predecessors, (72), 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) [2022-07-13 15:12:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:22,109 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-07-13 15:12:22,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 15:12:22,109 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.5) internal successors, (72), 41 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2022-07-13 15:12:22,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:22,110 INFO L225 Difference]: With dead ends: 49 [2022-07-13 15:12:22,110 INFO L226 Difference]: Without dead ends: 46 [2022-07-13 15:12:22,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1407 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=464, Invalid=5527, Unknown=15, NotChecked=0, Total=6006 [2022-07-13 15:12:22,111 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 57 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:22,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 316 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 623 Invalid, 0 Unknown, 6 Unchecked, 0.3s Time] [2022-07-13 15:12:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-13 15:12:22,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2022-07-13 15:12:22,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:12:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-07-13 15:12:22,136 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 44 [2022-07-13 15:12:22,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:22,136 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-07-13 15:12:22,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.5) internal successors, (72), 41 states have internal predecessors, (72), 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) [2022-07-13 15:12:22,137 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-07-13 15:12:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 15:12:22,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:22,137 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:12:22,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 15:12:22,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:22,339 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:22,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash 924724691, now seen corresponding path program 1 times [2022-07-13 15:12:22,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:22,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679288502] [2022-07-13 15:12:22,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:22,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:23,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:23,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:23,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:12:23,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:23,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679288502] [2022-07-13 15:12:23,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679288502] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:23,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437022094] [2022-07-13 15:12:23,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:23,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:23,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:23,608 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:12:23,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 15:12:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:23,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 161 conjunts are in the unsatisfiable core [2022-07-13 15:12:23,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:24,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:12:24,048 INFO L390 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 [2022-07-13 15:12:24,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:24,159 INFO L390 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 12 treesize of output 14 [2022-07-13 15:12:24,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:24,218 INFO L390 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 16 treesize of output 17 [2022-07-13 15:12:24,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:24,353 INFO L390 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 [2022-07-13 15:12:24,356 INFO L390 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 [2022-07-13 15:12:24,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:24,521 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-13 15:12:24,521 INFO L390 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 [2022-07-13 15:12:24,537 INFO L390 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 [2022-07-13 15:12:24,606 INFO L390 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 [2022-07-13 15:12:24,624 INFO L390 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 [2022-07-13 15:12:24,629 INFO L390 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 [2022-07-13 15:12:24,737 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:12:24,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 90 [2022-07-13 15:12:24,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:24,742 INFO L390 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 45 treesize of output 38 [2022-07-13 15:12:24,746 INFO L390 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 [2022-07-13 15:12:25,105 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:12:25,106 INFO L390 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 92 treesize of output 43 [2022-07-13 15:12:25,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:25,111 INFO L390 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 [2022-07-13 15:12:25,115 INFO L390 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 [2022-07-13 15:12:25,118 INFO L390 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 [2022-07-13 15:12:25,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:25,314 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:12:25,314 INFO L390 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 100 treesize of output 80 [2022-07-13 15:12:25,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:25,319 INFO L390 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 [2022-07-13 15:12:25,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:25,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:25,332 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:12:25,332 INFO L390 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 [2022-07-13 15:12:25,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:25,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 [2022-07-13 15:12:25,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:25,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:12:25,918 INFO L356 Elim1Store]: treesize reduction 153, result has 15.5 percent of original size [2022-07-13 15:12:25,919 INFO L390 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 264 treesize of output 136 [2022-07-13 15:12:25,938 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:12:25,938 INFO L390 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 328 treesize of output 205 [2022-07-13 15:12:25,959 INFO L356 Elim1Store]: treesize reduction 124, result has 15.1 percent of original size [2022-07-13 15:12:25,959 INFO L390 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 249 treesize of output 205 [2022-07-13 15:12:25,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:25,968 INFO L390 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 62 treesize of output 56 [2022-07-13 15:12:25,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:25,977 INFO L390 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 50 treesize of output 49 [2022-07-13 15:12:25,981 INFO L390 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 36 treesize of output 38 [2022-07-13 15:12:26,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:12:26,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:26,215 INFO L356 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-07-13 15:12:26,216 INFO L390 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 77 [2022-07-13 15:12:26,224 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:12:26,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-13 15:12:26,272 INFO L390 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 [2022-07-13 15:12:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:12:26,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:26,406 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1943)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1948)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1947))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1951)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1944) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-13 15:12:26,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1951 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_16| Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (let ((.cse7 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_16| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 v_ArrVal_1943)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1948)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1947))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse2 (store (select |c_#memory_int| .cse2) .cse1 v_ArrVal_1951)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1944) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7) |v_ULTIMATE.start_dll_append_~last~0#1.offset_16|))))))) is different from false [2022-07-13 15:12:26,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1951 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_16| Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse0)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_16| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_1943)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1948)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse6 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1947))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1951)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1944) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) (not (<= (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8) |v_ULTIMATE.start_dll_append_~last~0#1.offset_16|)) (not (= (select .cse6 .cse1) 0))))))) is different from false [2022-07-13 15:12:26,904 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| Int) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1951 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_16| Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1961)) (.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1963))) (let ((.cse1 (select (select .cse11 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse6 (select (select .cse11 .cse1) .cse2))) (let ((.cse3 (select .cse11 .cse6)) (.cse4 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_16| 4))) (or (not (<= (select (select .cse0 .cse1) .cse2) |v_ULTIMATE.start_dll_append_~last~0#1.offset_16|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| |c_#StackHeapBarrier|)) (not (= (select .cse3 .cse4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (store (store .cse0 .cse6 (store (select .cse0 .cse6) .cse4 v_ArrVal_1943)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1948)) (.cse7 (store (store .cse11 .cse6 (store .cse3 .cse4 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1947))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse5 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1962))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse4 v_ArrVal_1951))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1944) (select (select .cse7 .cse8) .cse9)) (select (select .cse10 .cse8) .cse9))))))))))) is different from false [2022-07-13 15:12:26,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437022094] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:26,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:26,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 57 [2022-07-13 15:12:26,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461573327] [2022-07-13 15:12:26,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:26,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-13 15:12:26,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:26,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-13 15:12:26,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3585, Unknown=5, NotChecked=492, Total=4290 [2022-07-13 15:12:26,911 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 57 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 47 states have internal predecessors, (74), 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) [2022-07-13 15:12:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:28,702 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-07-13 15:12:28,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 15:12:28,703 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 47 states have internal predecessors, (74), 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 44 [2022-07-13 15:12:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:28,704 INFO L225 Difference]: With dead ends: 48 [2022-07-13 15:12:28,704 INFO L226 Difference]: Without dead ends: 46 [2022-07-13 15:12:28,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=388, Invalid=5629, Unknown=5, NotChecked=620, Total=6642 [2022-07-13 15:12:28,705 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:28,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 337 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 872 Invalid, 0 Unknown, 65 Unchecked, 0.5s Time] [2022-07-13 15:12:28,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-13 15:12:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-07-13 15:12:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.15) internal successors, (46), 40 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) [2022-07-13 15:12:28,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-07-13 15:12:28,712 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 44 [2022-07-13 15:12:28,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:28,712 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-07-13 15:12:28,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 47 states have internal predecessors, (74), 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) [2022-07-13 15:12:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-07-13 15:12:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 15:12:28,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:28,713 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:12:28,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 15:12:28,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:28,926 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:28,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:28,926 INFO L85 PathProgramCache]: Analyzing trace with hash 478170515, now seen corresponding path program 2 times [2022-07-13 15:12:28,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:28,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470395001] [2022-07-13 15:12:28,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:29,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:29,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:29,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:12:29,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:29,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470395001] [2022-07-13 15:12:29,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470395001] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:29,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349565114] [2022-07-13 15:12:29,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:12:29,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:29,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:29,684 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:12:29,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 15:12:29,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:12:29,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:12:29,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 167 conjunts are in the unsatisfiable core [2022-07-13 15:12:29,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:29,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:12:29,972 INFO L390 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 [2022-07-13 15:12:30,059 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:12:30,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 15:12:30,113 INFO L390 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 [2022-07-13 15:12:30,241 INFO L390 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 [2022-07-13 15:12:30,245 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:12:30,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:12:30,376 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:12:30,376 INFO L390 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 [2022-07-13 15:12:30,409 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-13 15:12:30,410 INFO L390 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 5 case distinctions, treesize of input 22 treesize of output 33 [2022-07-13 15:12:30,483 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-13 15:12:30,486 INFO L390 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 [2022-07-13 15:12:30,508 INFO L390 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 [2022-07-13 15:12:30,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:30,518 INFO L390 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 16 treesize of output 17 [2022-07-13 15:12:30,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:30,610 INFO L356 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2022-07-13 15:12:30,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 59 [2022-07-13 15:12:30,623 INFO L390 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 [2022-07-13 15:12:30,626 INFO L390 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 [2022-07-13 15:12:30,921 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-13 15:12:30,921 INFO L390 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 120 treesize of output 56 [2022-07-13 15:12:30,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2022-07-13 15:12:30,930 INFO L390 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:12:30,936 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:12:30,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-07-13 15:12:31,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:31,155 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-13 15:12:31,156 INFO L390 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 126 treesize of output 116 [2022-07-13 15:12:31,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:31,162 INFO L390 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 [2022-07-13 15:12:31,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:31,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:31,167 INFO L390 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 101 treesize of output 98 [2022-07-13 15:12:31,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:31,181 INFO L356 Elim1Store]: treesize reduction 30, result has 47.4 percent of original size [2022-07-13 15:12:31,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 39 [2022-07-13 15:12:31,916 INFO L356 Elim1Store]: treesize reduction 262, result has 13.0 percent of original size [2022-07-13 15:12:31,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 14 case distinctions, treesize of input 372 treesize of output 153 [2022-07-13 15:12:31,956 INFO L356 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2022-07-13 15:12:31,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 212 treesize of output 196 [2022-07-13 15:12:31,972 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-13 15:12:31,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 128 [2022-07-13 15:12:31,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:31,990 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-13 15:12:31,991 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 145 [2022-07-13 15:12:32,003 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:12:32,003 INFO L390 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 1 case distinctions, treesize of input 29 treesize of output 41 [2022-07-13 15:12:32,016 INFO L390 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 [2022-07-13 15:12:32,032 INFO L390 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 51 treesize of output 35 [2022-07-13 15:12:32,040 INFO L390 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 51 treesize of output 35 [2022-07-13 15:12:32,235 INFO L356 Elim1Store]: treesize reduction 61, result has 28.2 percent of original size [2022-07-13 15:12:32,236 INFO L390 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 203 treesize of output 112 [2022-07-13 15:12:32,246 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-13 15:12:32,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 45 [2022-07-13 15:12:32,323 INFO L390 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 [2022-07-13 15:12:32,366 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:12:32,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:32,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_2223) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2232) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2229) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-13 15:12:32,872 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (let ((.cse2 (let ((.cse3 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse3)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse3) 4))))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_2223) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2232) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2229) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-13 15:12:32,887 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (+ (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 4))))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_2223) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2232) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2229) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= 0 (select .cse1 .cse2))))))) is different from false [2022-07-13 15:12:32,897 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (+ (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 4))))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_2223) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2232) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2229) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= 0 (select .cse1 .cse2))))))) is different from false [2022-07-13 15:12:32,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| Int) (v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2244 (Array Int Int)) (v_ArrVal_2243 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2242 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2244)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2242))) (let ((.cse0 (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (select .cse1 (select (select .cse1 .cse5) .cse6)) (+ (select (select .cse4 .cse5) .cse6) 4))))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2243) .cse0 v_ArrVal_2223) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2232) (select (select (store (store .cse1 .cse0 (store .cse2 .cse3 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2226) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse0 (store (select .cse4 .cse0) .cse3 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2229) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27|) 0)) (not (= (select .cse2 .cse3) 0))))))) is different from false [2022-07-13 15:12:32,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349565114] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:32,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:32,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31] total 53 [2022-07-13 15:12:32,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974916182] [2022-07-13 15:12:32,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:32,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-13 15:12:32,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:32,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-13 15:12:32,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3214, Unknown=53, NotChecked=590, Total=4032 [2022-07-13 15:12:32,982 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 53 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 44 states have internal predecessors, (74), 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) [2022-07-13 15:12:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:35,362 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2022-07-13 15:12:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 15:12:35,362 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 44 states have internal predecessors, (74), 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 44 [2022-07-13 15:12:35,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:35,363 INFO L225 Difference]: With dead ends: 73 [2022-07-13 15:12:35,363 INFO L226 Difference]: Without dead ends: 61 [2022-07-13 15:12:35,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=313, Invalid=5343, Unknown=64, NotChecked=760, Total=6480 [2022-07-13 15:12:35,365 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:35,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 462 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1085 Invalid, 0 Unknown, 135 Unchecked, 0.7s Time] [2022-07-13 15:12:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-13 15:12:35,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-07-13 15:12:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 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) [2022-07-13 15:12:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-07-13 15:12:35,373 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 44 [2022-07-13 15:12:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:35,373 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-07-13 15:12:35,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 44 states have internal predecessors, (74), 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) [2022-07-13 15:12:35,373 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-07-13 15:12:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 15:12:35,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:35,374 INFO L195 NwaCegarLoop]: 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, 1] [2022-07-13 15:12:35,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 15:12:35,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 15:12:35,591 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:35,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:35,592 INFO L85 PathProgramCache]: Analyzing trace with hash -397769244, now seen corresponding path program 2 times [2022-07-13 15:12:35,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:35,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366832484] [2022-07-13 15:12:35,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:35,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:36,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:36,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:36,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:12:36,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:36,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366832484] [2022-07-13 15:12:36,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366832484] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:36,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969118757] [2022-07-13 15:12:36,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:12:36,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:36,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:36,453 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:12:36,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 15:12:36,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:12:36,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:12:36,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 158 conjunts are in the unsatisfiable core [2022-07-13 15:12:36,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:36,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:12:36,735 INFO L390 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 [2022-07-13 15:12:36,836 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 15:12:36,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 15:12:37,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 15:12:37,053 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 580077 column 46: unknown constant v_old(#valid)_AFTER_CALL_24 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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) [2022-07-13 15:12:37,059 INFO L158 Benchmark]: Toolchain (without parser) took 34110.43ms. Allocated memory was 142.6MB in the beginning and 434.1MB in the end (delta: 291.5MB). Free memory was 113.6MB in the beginning and 371.9MB in the end (delta: -258.4MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2022-07-13 15:12:37,060 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory was 44.1MB in the beginning and 44.0MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:12:37,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.68ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 112.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 15:12:37,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.21ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 110.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:12:37,063 INFO L158 Benchmark]: Boogie Preprocessor took 20.63ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 108.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:12:37,064 INFO L158 Benchmark]: RCFGBuilder took 319.82ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 94.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 15:12:37,064 INFO L158 Benchmark]: TraceAbstraction took 33364.70ms. Allocated memory was 142.6MB in the beginning and 434.1MB in the end (delta: 291.5MB). Free memory was 93.4MB in the beginning and 371.9MB in the end (delta: -278.5MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2022-07-13 15:12:37,070 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.14ms. Allocated memory is still 88.1MB. Free memory was 44.1MB in the beginning and 44.0MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.68ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 112.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.21ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 110.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.63ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 108.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 319.82ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 94.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 33364.70ms. Allocated memory was 142.6MB in the beginning and 434.1MB in the end (delta: 291.5MB). Free memory was 93.4MB in the beginning and 371.9MB in the end (delta: -278.5MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 580077 column 46: unknown constant v_old(#valid)_AFTER_CALL_24 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 580077 column 46: unknown constant v_old(#valid)_AFTER_CALL_24: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 15:12:37,097 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/dll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:12:38,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:12:38,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:12:38,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:12:38,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:12:38,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:12:38,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:12:38,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:12:38,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:12:38,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:12:38,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:12:38,853 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:12:38,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:12:38,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:12:38,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:12:38,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:12:38,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:12:38,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:12:38,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:12:38,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:12:38,867 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:12:38,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:12:38,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:12:38,870 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:12:38,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:12:38,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:12:38,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:12:38,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:12:38,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:12:38,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:12:38,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:12:38,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:12:38,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:12:38,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:12:38,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:12:38,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:12:38,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:12:38,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:12:38,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:12:38,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:12:38,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:12:38,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:12:38,890 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 15:12:38,914 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:12:38,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:12:38,915 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:12:38,915 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:12:38,916 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:12:38,916 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:12:38,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:12:38,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:12:38,917 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:12:38,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:12:38,917 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:12:38,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:12:38,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:12:38,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:12:38,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:12:38,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:12:38,923 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 15:12:38,923 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 15:12:38,923 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 15:12:38,924 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:12:38,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:12:38,924 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:12:38,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:12:38,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:12:38,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:12:38,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:12:38,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:12:38,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:12:38,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:12:38,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:12:38,926 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 15:12:38,926 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 15:12:38,926 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:12:38,926 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:12:38,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:12:38,927 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 15:12:38,927 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 -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2022-07-13 15:12:39,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:12:39,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:12:39,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:12:39,220 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:12:39,221 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:12:39,222 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-07-13 15:12:39,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b749a0886/7b5f672cd22345d4b9588b397e791449/FLAGe4ca9a9c2 [2022-07-13 15:12:39,664 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:12:39,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-07-13 15:12:39,701 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b749a0886/7b5f672cd22345d4b9588b397e791449/FLAGe4ca9a9c2 [2022-07-13 15:12:40,042 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b749a0886/7b5f672cd22345d4b9588b397e791449 [2022-07-13 15:12:40,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:12:40,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:12:40,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:12:40,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:12:40,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:12:40,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:12:40" (1/1) ... [2022-07-13 15:12:40,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e86ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:40, skipping insertion in model container [2022-07-13 15:12:40,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:12:40" (1/1) ... [2022-07-13 15:12:40,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:12:40,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:12:40,362 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/dll2n_append_equal.i[24333,24346] [2022-07-13 15:12:40,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:12:40,370 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:12:40,421 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/dll2n_append_equal.i[24333,24346] [2022-07-13 15:12:40,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:12:40,446 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:12:40,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:40 WrapperNode [2022-07-13 15:12:40,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:12:40,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:12:40,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:12:40,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:12:40,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:40" (1/1) ... [2022-07-13 15:12:40,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:40" (1/1) ... [2022-07-13 15:12:40,492 INFO L137 Inliner]: procedures = 130, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 123 [2022-07-13 15:12:40,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:12:40,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:12:40,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:12:40,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:12:40,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:40" (1/1) ... [2022-07-13 15:12:40,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:40" (1/1) ... [2022-07-13 15:12:40,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:40" (1/1) ... [2022-07-13 15:12:40,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:40" (1/1) ... [2022-07-13 15:12:40,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:40" (1/1) ... [2022-07-13 15:12:40,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:40" (1/1) ... [2022-07-13 15:12:40,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:40" (1/1) ... [2022-07-13 15:12:40,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:12:40,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:12:40,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:12:40,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:12:40,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:40" (1/1) ... [2022-07-13 15:12:40,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:12:40,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:40,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:12:40,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:12:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 15:12:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-13 15:12:40,630 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-13 15:12:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:12:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:12:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 15:12:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:12:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:12:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:12:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 15:12:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 15:12:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 15:12:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:12:40,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:12:40,770 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:12:40,771 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:12:41,044 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:12:41,052 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:12:41,052 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 15:12:41,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:12:41 BoogieIcfgContainer [2022-07-13 15:12:41,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:12:41,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:12:41,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:12:41,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:12:41,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:12:40" (1/3) ... [2022-07-13 15:12:41,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479aed7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:12:41, skipping insertion in model container [2022-07-13 15:12:41,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:40" (2/3) ... [2022-07-13 15:12:41,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479aed7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:12:41, skipping insertion in model container [2022-07-13 15:12:41,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:12:41" (3/3) ... [2022-07-13 15:12:41,066 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2022-07-13 15:12:41,076 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:12:41,076 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:12:41,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:12:41,112 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7900bfa9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@407b4e22 [2022-07-13 15:12:41,112 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:12:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 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) [2022-07-13 15:12:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 15:12:41,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:41,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:12:41,122 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:41,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:41,125 INFO L85 PathProgramCache]: Analyzing trace with hash 308507763, now seen corresponding path program 1 times [2022-07-13 15:12:41,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:12:41,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857844542] [2022-07-13 15:12:41,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:41,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:12:41,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:12:41,136 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) [2022-07-13 15:12:41,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 15:12:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:41,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 15:12:41,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:12:41,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:12:41,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:12:41,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857844542] [2022-07-13 15:12:41,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857844542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:12:41,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:12:41,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:12:41,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453721939] [2022-07-13 15:12:41,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:12:41,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:12:41,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:12:41,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:12:41,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:12:41,264 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 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) [2022-07-13 15:12:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:41,275 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-07-13 15:12:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:12:41,277 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 [2022-07-13 15:12:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:41,281 INFO L225 Difference]: With dead ends: 57 [2022-07-13 15:12:41,281 INFO L226 Difference]: Without dead ends: 26 [2022-07-13 15:12:41,283 INFO L412 NwaCegarLoop]: 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 [2022-07-13 15:12:41,285 INFO L413 NwaCegarLoop]: 40 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, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:41,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:12:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-13 15:12:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-13 15:12:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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) [2022-07-13 15:12:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-13 15:12:41,307 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2022-07-13 15:12:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:41,307 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-13 15:12:41,307 INFO L496 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) [2022-07-13 15:12:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-07-13 15:12:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 15:12:41,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:41,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:12:41,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 15:12:41,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:12:41,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:41,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:41,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2109805219, now seen corresponding path program 1 times [2022-07-13 15:12:41,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:12:41,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606844286] [2022-07-13 15:12:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:41,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:12:41,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:12:41,520 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) [2022-07-13 15:12:41,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 15:12:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:41,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 15:12:41,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:12:41,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:12:41,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:12:41,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606844286] [2022-07-13 15:12:41,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606844286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:12:41,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:12:41,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:12:41,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073957633] [2022-07-13 15:12:41,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:12:41,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:12:41,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:12:41,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:12:41,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:12:41,670 INFO L87 Difference]: Start difference. First operand 26 states and 32 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) [2022-07-13 15:12:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:41,680 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-07-13 15:12:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:12:41,681 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 [2022-07-13 15:12:41,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:41,682 INFO L225 Difference]: With dead ends: 50 [2022-07-13 15:12:41,682 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 15:12:41,682 INFO L412 NwaCegarLoop]: 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 [2022-07-13 15:12:41,683 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 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 [2022-07-13 15:12:41,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:12:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 15:12:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-07-13 15:12:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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) [2022-07-13 15:12:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-07-13 15:12:41,688 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2022-07-13 15:12:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:41,689 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-07-13 15:12:41,689 INFO L496 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) [2022-07-13 15:12:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-07-13 15:12:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:12:41,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:41,690 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:12:41,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:12:41,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:12:41,901 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:41,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:41,901 INFO L85 PathProgramCache]: Analyzing trace with hash 493100305, now seen corresponding path program 1 times [2022-07-13 15:12:41,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:12:41,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968886736] [2022-07-13 15:12:41,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:41,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:12:41,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:12:41,924 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) [2022-07-13 15:12:41,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 15:12:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:42,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 15:12:42,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:12:42,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:12:42,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:12:42,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968886736] [2022-07-13 15:12:42,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968886736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:12:42,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:12:42,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:12:42,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581193455] [2022-07-13 15:12:42,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:12:42,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:12:42,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:12:42,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:12:42,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:12:42,117 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:12:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:42,156 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-07-13 15:12:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:12:42,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-13 15:12:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:42,157 INFO L225 Difference]: With dead ends: 55 [2022-07-13 15:12:42,157 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 15:12:42,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:12:42,159 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:42,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:12:42,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 15:12:42,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-07-13 15:12:42,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:12:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-07-13 15:12:42,163 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2022-07-13 15:12:42,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:42,163 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-07-13 15:12:42,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:12:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-07-13 15:12:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:12:42,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:42,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:12:42,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 15:12:42,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:12:42,377 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:42,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:42,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247597, now seen corresponding path program 1 times [2022-07-13 15:12:42,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:12:42,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998942214] [2022-07-13 15:12:42,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:42,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:12:42,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:12:42,379 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) [2022-07-13 15:12:42,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 15:12:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:42,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:12:42,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:12:42,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:12:42,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:12:42,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998942214] [2022-07-13 15:12:42,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998942214] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:12:42,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:42,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-13 15:12:42,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727152121] [2022-07-13 15:12:42,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:42,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:12:42,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:12:42,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:12:42,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:12:42,551 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) [2022-07-13 15:12:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:42,581 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-07-13 15:12:42,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:12:42,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 27 [2022-07-13 15:12:42,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:42,583 INFO L225 Difference]: With dead ends: 55 [2022-07-13 15:12:42,583 INFO L226 Difference]: Without dead ends: 36 [2022-07-13 15:12:42,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:12:42,584 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:42,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 144 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:12:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-13 15:12:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-07-13 15:12:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:12:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-07-13 15:12:42,588 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2022-07-13 15:12:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:42,589 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-07-13 15:12:42,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) [2022-07-13 15:12:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-07-13 15:12:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:12:42,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:42,590 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:12:42,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 15:12:42,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:12:42,798 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:42,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash -292922041, now seen corresponding path program 1 times [2022-07-13 15:12:42,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:12:42,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747280260] [2022-07-13 15:12:42,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:42,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:12:42,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:12:42,801 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:12:42,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 15:12:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:42,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 15:12:42,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:43,046 INFO L390 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 [2022-07-13 15:12:43,060 INFO L390 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 [2022-07-13 15:12:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 15:12:43,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:12:43,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:12:43,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747280260] [2022-07-13 15:12:43,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747280260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:12:43,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:12:43,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 15:12:43,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602836371] [2022-07-13 15:12:43,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:12:43,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 15:12:43,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:12:43,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 15:12:43,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:12:43,071 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:12:43,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:43,326 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-13 15:12:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:12:43,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-07-13 15:12:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:43,328 INFO L225 Difference]: With dead ends: 45 [2022-07-13 15:12:43,328 INFO L226 Difference]: Without dead ends: 42 [2022-07-13 15:12:43,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-13 15:12:43,329 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:43,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 148 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:12:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-13 15:12:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-07-13 15:12:43,333 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) [2022-07-13 15:12:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-07-13 15:12:43,333 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 37 [2022-07-13 15:12:43,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:43,334 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-07-13 15:12:43,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:12:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-07-13 15:12:43,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:12:43,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:43,335 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:12:43,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-13 15:12:43,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:12:43,544 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:43,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:43,544 INFO L85 PathProgramCache]: Analyzing trace with hash -292920367, now seen corresponding path program 1 times [2022-07-13 15:12:43,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:12:43,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044405146] [2022-07-13 15:12:43,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:43,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:12:43,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:12:43,546 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) [2022-07-13 15:12:43,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 15:12:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:43,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 15:12:43,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:43,841 INFO L390 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 [2022-07-13 15:12:43,904 INFO L390 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 [2022-07-13 15:12:44,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:44,003 INFO L390 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 [2022-07-13 15:12:44,048 INFO L390 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 [2022-07-13 15:12:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:12:44,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:44,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:12:44,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044405146] [2022-07-13 15:12:44,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044405146] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:44,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1088401121] [2022-07-13 15:12:44,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:44,189 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:12:44,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:12:44,200 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) [2022-07-13 15:12:44,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-07-13 15:12:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:44,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 15:12:44,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:44,776 INFO L390 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 [2022-07-13 15:12:44,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:44,846 INFO L390 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 [2022-07-13 15:12:44,898 INFO L390 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 [2022-07-13 15:12:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:12:44,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:44,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1088401121] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:44,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:44,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2022-07-13 15:12:45,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217911530] [2022-07-13 15:12:45,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:45,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 15:12:45,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:12:45,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 15:12:45,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=504, Unknown=6, NotChecked=0, Total=600 [2022-07-13 15:12:45,001 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 23 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 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) [2022-07-13 15:12:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:45,580 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-07-13 15:12:45,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:12:45,581 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 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 37 [2022-07-13 15:12:45,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:45,582 INFO L225 Difference]: With dead ends: 39 [2022-07-13 15:12:45,582 INFO L226 Difference]: Without dead ends: 32 [2022-07-13 15:12:45,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=723, Unknown=7, NotChecked=0, Total=870 [2022-07-13 15:12:45,583 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:45,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 211 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 52 Unchecked, 0.4s Time] [2022-07-13 15:12:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-13 15:12:45,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-13 15:12:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:12:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-07-13 15:12:45,586 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2022-07-13 15:12:45,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:45,586 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-07-13 15:12:45,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 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) [2022-07-13 15:12:45,586 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-07-13 15:12:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 15:12:45,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:45,591 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-13 15:12:45,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2022-07-13 15:12:45,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-13 15:12:45,992 WARN L477 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 [2022-07-13 15:12:45,992 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:45,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:45,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1499731437, now seen corresponding path program 1 times [2022-07-13 15:12:45,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:12:45,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087786895] [2022-07-13 15:12:45,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:45,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:12:45,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:12:45,996 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) [2022-07-13 15:12:45,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 15:12:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:46,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 15:12:46,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:46,328 INFO L390 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 [2022-07-13 15:12:46,417 INFO L390 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 [2022-07-13 15:12:46,512 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_516))) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (and (not (= v_arrayElimCell_8 (_ bv0 32))) (bvult v_arrayElimCell_8 |c_#StackHeapBarrier|))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-13 15:12:46,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:46,546 INFO L390 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 22 treesize of output 22 [2022-07-13 15:12:46,781 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-13 15:12:46,782 INFO L390 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-07-13 15:12:46,830 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-13 15:12:46,830 INFO L390 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 45 treesize of output 50 [2022-07-13 15:12:46,840 INFO L390 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 19 treesize of output 11 [2022-07-13 15:12:46,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-13 15:12:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-07-13 15:12:46,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:46,997 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_520) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-13 15:12:47,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (not (= (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd (_ bv4 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_520) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-13 15:12:47,039 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd (_ bv4 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_520) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-13 15:12:47,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:12:47,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087786895] [2022-07-13 15:12:47,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087786895] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:47,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1911804374] [2022-07-13 15:12:47,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:47,224 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:12:47,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:12:47,226 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) [2022-07-13 15:12:47,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-07-13 15:12:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:47,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-13 15:12:47,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:48,445 INFO L356 Elim1Store]: treesize reduction 39, result has 37.1 percent of original size [2022-07-13 15:12:48,446 INFO L390 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 2 case distinctions, treesize of input 76 treesize of output 70 [2022-07-13 15:12:48,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:48,456 INFO L390 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 56 treesize of output 54 [2022-07-13 15:12:48,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:48,497 INFO L356 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-07-13 15:12:48,497 INFO L390 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 2 case distinctions, treesize of input 50 treesize of output 68 [2022-07-13 15:12:48,514 INFO L390 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 24 treesize of output 20 [2022-07-13 15:12:48,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-13 15:12:48,637 INFO L390 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 21 treesize of output 13 [2022-07-13 15:12:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 15:12:48,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:12:48,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1911804374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:12:48,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 15:12:48,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [19] total 28 [2022-07-13 15:12:48,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496496210] [2022-07-13 15:12:48,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:12:48,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 15:12:48,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:12:48,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 15:12:48,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=771, Unknown=14, NotChecked=236, Total=1122 [2022-07-13 15:12:48,679 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:12:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:48,882 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-07-13 15:12:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 15:12:48,883 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2022-07-13 15:12:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:48,883 INFO L225 Difference]: With dead ends: 42 [2022-07-13 15:12:48,883 INFO L226 Difference]: Without dead ends: 39 [2022-07-13 15:12:48,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=879, Unknown=16, NotChecked=252, Total=1260 [2022-07-13 15:12:48,889 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:48,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 154 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2022-07-13 15:12:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-13 15:12:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-07-13 15:12:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:12:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-07-13 15:12:48,899 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 40 [2022-07-13 15:12:48,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:48,899 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-07-13 15:12:48,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:12:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-07-13 15:12:48,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 15:12:48,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:48,900 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-13 15:12:48,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-13 15:12:49,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-07-13 15:12:49,313 WARN L477 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 [2022-07-13 15:12:49,313 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:49,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:49,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1499729763, now seen corresponding path program 1 times [2022-07-13 15:12:49,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:12:49,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258135927] [2022-07-13 15:12:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:49,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:12:49,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:12:49,324 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) [2022-07-13 15:12:49,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 15:12:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:49,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-13 15:12:49,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:49,583 INFO L390 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 [2022-07-13 15:12:49,773 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:12:49,774 INFO L390 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 19 treesize of output 26 [2022-07-13 15:12:49,824 INFO L390 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 [2022-07-13 15:12:49,885 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:12:49,886 INFO L390 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 47 treesize of output 46 [2022-07-13 15:12:50,097 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-13 15:12:50,098 INFO L390 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 54 treesize of output 34 [2022-07-13 15:12:50,104 INFO L390 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 14 treesize of output 10 [2022-07-13 15:12:50,109 INFO L390 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 [2022-07-13 15:12:50,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:50,260 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:12:50,261 INFO L390 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 60 treesize of output 52 [2022-07-13 15:12:50,285 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:12:50,285 INFO L390 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 31 treesize of output 33 [2022-07-13 15:12:50,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:50,295 INFO L390 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 [2022-07-13 15:12:50,380 INFO L390 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 [2022-07-13 15:12:50,453 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-13 15:12:50,453 INFO L390 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 60 treesize of output 32 [2022-07-13 15:12:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:12:50,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:50,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:12:50,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258135927] [2022-07-13 15:12:50,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258135927] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:50,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [792156780] [2022-07-13 15:12:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:50,691 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:12:50,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:12:50,692 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) [2022-07-13 15:12:50,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-07-13 15:12:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:51,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-13 15:12:51,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:51,161 INFO L390 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 [2022-07-13 15:12:51,516 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:12:51,517 INFO L390 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 19 treesize of output 26 [2022-07-13 15:12:51,607 INFO L390 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 [2022-07-13 15:12:51,723 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:12:51,724 INFO L390 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 47 treesize of output 46 [2022-07-13 15:12:52,164 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:12:52,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 28 [2022-07-13 15:12:52,169 INFO L390 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 [2022-07-13 15:12:52,175 INFO L390 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 14 treesize of output 10 [2022-07-13 15:12:52,385 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:12:52,385 INFO L390 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 14 treesize of output 20 [2022-07-13 15:12:52,393 INFO L390 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 [2022-07-13 15:12:52,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:52,420 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:12:52,420 INFO L390 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 67 treesize of output 57 [2022-07-13 15:12:52,447 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:12:52,447 INFO L390 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 31 treesize of output 33 [2022-07-13 15:12:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:12:53,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:53,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [792156780] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:53,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:53,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 42 [2022-07-13 15:12:53,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481516247] [2022-07-13 15:12:53,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:53,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-13 15:12:53,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:12:53,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-13 15:12:53,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1783, Unknown=11, NotChecked=0, Total=1980 [2022-07-13 15:12:53,172 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 42 states, 40 states have (on average 1.425) internal successors, (57), 33 states have internal predecessors, (57), 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) [2022-07-13 15:12:54,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:54,839 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-07-13 15:12:54,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 15:12:54,840 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.425) internal successors, (57), 33 states have internal predecessors, (57), 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 40 [2022-07-13 15:12:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:54,841 INFO L225 Difference]: With dead ends: 65 [2022-07-13 15:12:54,842 INFO L226 Difference]: Without dead ends: 36 [2022-07-13 15:12:54,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=291, Invalid=2453, Unknown=12, NotChecked=0, Total=2756 [2022-07-13 15:12:54,843 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:54,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 308 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 305 Invalid, 0 Unknown, 91 Unchecked, 0.8s Time] [2022-07-13 15:12:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-13 15:12:54,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-07-13 15:12:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:12:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-07-13 15:12:54,848 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 40 [2022-07-13 15:12:54,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:54,848 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-07-13 15:12:54,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.425) internal successors, (57), 33 states have internal predecessors, (57), 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) [2022-07-13 15:12:54,849 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-07-13 15:12:54,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-13 15:12:54,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:54,849 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:12:54,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 15:12:55,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-07-13 15:12:55,263 WARN L477 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 [2022-07-13 15:12:55,263 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:55,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:55,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1422188014, now seen corresponding path program 1 times [2022-07-13 15:12:55,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:12:55,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586892896] [2022-07-13 15:12:55,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:55,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:12:55,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:12:55,266 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) [2022-07-13 15:12:55,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 15:12:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:55,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-13 15:12:55,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:55,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:12:55,531 INFO L390 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 [2022-07-13 15:12:55,592 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:12:55,593 INFO L390 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 24 [2022-07-13 15:12:55,687 INFO L390 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 13 treesize of output 9 [2022-07-13 15:12:55,788 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 15:12:55,789 INFO L390 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 24 treesize of output 41 [2022-07-13 15:12:55,841 INFO L390 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 [2022-07-13 15:12:55,919 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:12:55,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2022-07-13 15:12:56,212 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:12:56,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 31 [2022-07-13 15:12:56,219 INFO L390 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 [2022-07-13 15:12:56,225 INFO L390 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 19 treesize of output 13 [2022-07-13 15:12:56,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:56,379 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:12:56,379 INFO L390 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 62 [2022-07-13 15:12:56,398 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-13 15:12:56,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 40 [2022-07-13 15:12:56,439 INFO L390 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 [2022-07-13 15:12:56,697 INFO L390 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 [2022-07-13 15:12:56,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:56,987 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:12:56,988 INFO L390 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 69 [2022-07-13 15:12:57,109 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:12:57,109 INFO L390 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 72 treesize of output 31 [2022-07-13 15:12:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:12:57,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:57,200 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-13 15:12:57,215 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)) v_ArrVal_948) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-13 15:12:57,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))) v_ArrVal_948) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-13 15:12:57,234 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))) v_ArrVal_948) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-13 15:12:57,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:12:57,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586892896] [2022-07-13 15:12:57,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586892896] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:57,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [640235594] [2022-07-13 15:12:57,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:57,394 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:12:57,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:12:57,396 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) [2022-07-13 15:12:57,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-07-13 15:12:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:57,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-13 15:12:57,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:58,490 INFO L356 Elim1Store]: treesize reduction 70, result has 38.1 percent of original size [2022-07-13 15:12:58,490 INFO L390 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 93 [2022-07-13 15:12:58,540 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-13 15:12:58,540 INFO L390 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 61 treesize of output 65 [2022-07-13 15:12:58,616 INFO L356 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2022-07-13 15:12:58,616 INFO L390 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 78 treesize of output 99 [2022-07-13 15:12:58,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:58,629 INFO L390 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 28 treesize of output 30 [2022-07-13 15:12:58,743 INFO L390 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 62 treesize of output 46 [2022-07-13 15:12:58,802 INFO L390 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 60 treesize of output 44 [2022-07-13 15:12:59,746 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:12:59,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2022-07-13 15:12:59,975 INFO L390 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 29 treesize of output 17 [2022-07-13 15:13:01,412 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:01,412 INFO L390 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 213 treesize of output 165 [2022-07-13 15:13:01,416 INFO L390 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 172 treesize of output 152 [2022-07-13 15:13:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 15:13:08,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:08,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (or (forall ((v_ArrVal_1051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1053 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) v_ArrVal_1053)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_1052 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))))) is different from false [2022-07-13 15:13:08,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1051 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_14| (_ BitVec 32)) (v_ArrVal_1053 (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_14| (_ bv4 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_1053)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))))) is different from false [2022-07-13 15:13:08,769 INFO L356 Elim1Store]: treesize reduction 67, result has 46.8 percent of original size [2022-07-13 15:13:08,770 INFO L390 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 110 [2022-07-13 15:13:08,810 INFO L356 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2022-07-13 15:13:08,810 INFO L390 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 2 case distinctions, treesize of input 61 treesize of output 69 [2022-07-13 15:13:08,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:08,836 INFO L390 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 45 treesize of output 48 [2022-07-13 15:13:08,917 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:08,917 INFO L390 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 133 [2022-07-13 15:13:08,936 INFO L390 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 20 treesize of output 18 [2022-07-13 15:13:08,945 INFO L390 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 20 treesize of output 18 [2022-07-13 15:13:09,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [640235594] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:09,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:13:09,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 13] total 37 [2022-07-13 15:13:09,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897002795] [2022-07-13 15:13:09,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:13:09,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-13 15:13:09,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:13:09,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-13 15:13:09,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1734, Unknown=11, NotChecked=534, Total=2450 [2022-07-13 15:13:09,926 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 37 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 31 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 15:13:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:13:12,089 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-07-13 15:13:12,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 15:13:12,089 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 31 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-07-13 15:13:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:13:12,090 INFO L225 Difference]: With dead ends: 46 [2022-07-13 15:13:12,090 INFO L226 Difference]: Without dead ends: 43 [2022-07-13 15:13:12,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=323, Invalid=3230, Unknown=11, NotChecked=726, Total=4290 [2022-07-13 15:13:12,092 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 15:13:12,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 354 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 289 Invalid, 0 Unknown, 166 Unchecked, 0.8s Time] [2022-07-13 15:13:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-13 15:13:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-13 15:13:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:13:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-07-13 15:13:12,100 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 42 [2022-07-13 15:13:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:13:12,100 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-13 15:13:12,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 31 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 15:13:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-07-13 15:13:12,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-13 15:13:12,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:13:12,103 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:13:12,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2022-07-13 15:13:12,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-13 15:13:12,506 WARN L477 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 [2022-07-13 15:13:12,507 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:13:12,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:13:12,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1422189688, now seen corresponding path program 1 times [2022-07-13 15:13:12,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:13:12,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28281399] [2022-07-13 15:13:12,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:12,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:13:12,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:13:12,508 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) [2022-07-13 15:13:12,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-13 15:13:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:12,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-13 15:13:12,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:12,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:13:12,892 INFO L390 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 [2022-07-13 15:13:12,951 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:13:12,951 INFO L390 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 24 [2022-07-13 15:13:13,058 INFO L390 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 13 treesize of output 9 [2022-07-13 15:13:13,145 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 15:13:13,146 INFO L390 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 24 treesize of output 41 [2022-07-13 15:13:13,206 INFO L390 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 [2022-07-13 15:13:13,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:13,216 INFO L390 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 16 treesize of output 17 [2022-07-13 15:13:13,294 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:13:13,294 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-07-13 15:13:13,299 INFO L390 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 [2022-07-13 15:13:13,629 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:13:13,630 INFO L390 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 72 treesize of output 35 [2022-07-13 15:13:13,637 INFO L390 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 [2022-07-13 15:13:13,643 INFO L390 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 [2022-07-13 15:13:13,649 INFO L390 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 20 treesize of output 14 [2022-07-13 15:13:13,826 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:13:13,826 INFO L390 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 14 treesize of output 20 [2022-07-13 15:13:13,829 INFO L390 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 [2022-07-13 15:13:13,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:13,871 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:13:13,871 INFO L390 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 78 treesize of output 66 [2022-07-13 15:13:13,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:13,878 INFO L390 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 [2022-07-13 15:13:13,919 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-13 15:13:13,919 INFO L390 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 37 treesize of output 41 [2022-07-13 15:13:14,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:13:14,600 INFO L356 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2022-07-13 15:13:14,600 INFO L390 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 90 [2022-07-13 15:13:14,648 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:13:14,648 INFO L390 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 261 treesize of output 160 [2022-07-13 15:13:14,684 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-13 15:13:14,684 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 223 treesize of output 213 [2022-07-13 15:13:14,694 INFO L390 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 55 treesize of output 59 [2022-07-13 15:13:14,841 INFO L356 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-07-13 15:13:14,841 INFO L390 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 156 treesize of output 40 [2022-07-13 15:13:14,847 INFO L390 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 [2022-07-13 15:13:14,945 INFO L390 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 [2022-07-13 15:13:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:13:14,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:15,133 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1170 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1168) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1166) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1169) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-13 15:13:15,166 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1166 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (_ BitVec 32)) (v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1168) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1166) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1169) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1170) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-13 15:13:15,193 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1166 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (_ BitVec 32)) (v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1170 (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_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1168) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1166) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1169) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1170) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-13 15:13:15,218 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1166 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (_ BitVec 32)) (v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1170 (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_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1168) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1166) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (_ bv4 32)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1169) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1170) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-13 15:13:15,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:13:15,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28281399] [2022-07-13 15:13:15,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28281399] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:15,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1988470843] [2022-07-13 15:13:15,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:15,545 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:13:15,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:13:15,546 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:13:15,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-07-13 15:13:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:16,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-13 15:13:16,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:16,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:13:16,707 INFO L390 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 5 [2022-07-13 15:13:16,980 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:13:16,980 INFO L390 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 19 treesize of output 26 [2022-07-13 15:13:17,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:17,117 INFO L390 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 16 treesize of output 17 [2022-07-13 15:13:17,130 INFO L390 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 [2022-07-13 15:13:17,280 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:13:17,281 INFO L390 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 57 treesize of output 54 [2022-07-13 15:13:17,285 INFO L390 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 [2022-07-13 15:13:17,905 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:17,905 INFO L390 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 63 treesize of output 30 [2022-07-13 15:13:17,910 INFO L390 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 13 treesize of output 9 [2022-07-13 15:13:17,915 INFO L390 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 [2022-07-13 15:13:17,919 INFO L390 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 [2022-07-13 15:13:18,131 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:13:18,131 INFO L390 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 14 treesize of output 20 [2022-07-13 15:13:18,137 INFO L390 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 [2022-07-13 15:13:18,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:18,168 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:13:18,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2022-07-13 15:13:18,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:18,183 INFO L390 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 [2022-07-13 15:13:18,211 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:13:18,212 INFO L390 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 30 treesize of output 32 [2022-07-13 15:13:19,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:19,156 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:13:19,156 INFO L390 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 105 [2022-07-13 15:13:19,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:19,201 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-13 15:13:19,202 INFO L390 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 57 [2022-07-13 15:13:19,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:19,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:19,212 INFO L390 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 35 treesize of output 39 [2022-07-13 15:13:19,568 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:19,569 INFO L390 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 [2022-07-13 15:13:19,579 INFO L390 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 [2022-07-13 15:13:19,666 INFO L390 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 [2022-07-13 15:13:19,668 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:13:19,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:19,705 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1297) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1293) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1296) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1295) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-13 15:13:19,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1297) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1293) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1296) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1295) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-13 15:13:19,746 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1297 (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_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1297) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1293) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1296) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1295) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-13 15:13:19,761 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1297 (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_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1297) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1293) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1296) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1298) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1295) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-13 15:13:20,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1988470843] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:20,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:13:20,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 49 [2022-07-13 15:13:20,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268804370] [2022-07-13 15:13:20,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:13:20,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-13 15:13:20,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:13:20,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-13 15:13:20,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2677, Unknown=16, NotChecked=888, Total=3782 [2022-07-13 15:13:20,332 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 49 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 38 states have internal predecessors, (65), 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) [2022-07-13 15:13:24,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:13:24,124 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-07-13 15:13:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 15:13:24,124 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 38 states have internal predecessors, (65), 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 [2022-07-13 15:13:24,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:13:24,126 INFO L225 Difference]: With dead ends: 44 [2022-07-13 15:13:24,127 INFO L226 Difference]: Without dead ends: 42 [2022-07-13 15:13:24,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=377, Invalid=4609, Unknown=16, NotChecked=1160, Total=6162 [2022-07-13 15:13:24,128 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 46 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:13:24,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 286 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 403 Invalid, 0 Unknown, 161 Unchecked, 1.1s Time] [2022-07-13 15:13:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-13 15:13:24,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-07-13 15:13:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:13:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-07-13 15:13:24,133 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 42 [2022-07-13 15:13:24,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:13:24,134 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-07-13 15:13:24,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 38 states have internal predecessors, (65), 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) [2022-07-13 15:13:24,134 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-07-13 15:13:24,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 15:13:24,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:13:24,135 INFO L195 NwaCegarLoop]: 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, 1] [2022-07-13 15:13:24,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-07-13 15:13:24,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-13 15:13:24,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:13:24,539 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:13:24,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:13:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash 924723017, now seen corresponding path program 1 times [2022-07-13 15:13:24,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:13:24,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470893613] [2022-07-13 15:13:24,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:24,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:13:24,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:13:24,541 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:13:24,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-13 15:13:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:24,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-13 15:13:24,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:24,836 INFO L390 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 [2022-07-13 15:13:24,852 INFO L390 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 5 [2022-07-13 15:13:24,931 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:13:24,932 INFO L390 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 19 treesize of output 26 [2022-07-13 15:13:25,046 INFO L390 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 13 treesize of output 9 [2022-07-13 15:13:25,140 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 15:13:25,140 INFO L390 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 24 treesize of output 41 [2022-07-13 15:13:25,200 INFO L390 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 [2022-07-13 15:13:25,282 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:13:25,282 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-07-13 15:13:25,611 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:13:25,611 INFO L390 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 73 treesize of output 32 [2022-07-13 15:13:25,617 INFO L390 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 [2022-07-13 15:13:25,623 INFO L390 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 20 treesize of output 14 [2022-07-13 15:13:25,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:25,784 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:13:25,784 INFO L390 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 63 [2022-07-13 15:13:25,818 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-13 15:13:25,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2022-07-13 15:13:25,839 INFO L390 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 [2022-07-13 15:13:26,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:26,386 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:13:26,387 INFO L390 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 92 [2022-07-13 15:13:26,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:26,418 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-13 15:13:26,419 INFO L390 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 36 [2022-07-13 15:13:26,546 INFO L390 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 [2022-07-13 15:13:26,702 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:13:26,703 INFO L390 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 80 treesize of output 31 [2022-07-13 15:13:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:13:26,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:26,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1416))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-13 15:13:26,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1415) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1416))) (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 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1413) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (_ bv0 32)))) is different from false [2022-07-13 15:13:26,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1415) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1416))) (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 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1413) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (_ bv0 32)))) is different from false [2022-07-13 15:13:26,898 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1415) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1416))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1413) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (_ bv0 32)))) is different from false [2022-07-13 15:13:27,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:13:27,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470893613] [2022-07-13 15:13:27,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470893613] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:27,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [967842301] [2022-07-13 15:13:27,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:27,175 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:13:27,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:13:27,177 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:13:27,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-07-13 15:13:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:27,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-13 15:13:27,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:27,759 INFO L390 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 [2022-07-13 15:13:28,342 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:13:28,343 INFO L390 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 19 treesize of output 26 [2022-07-13 15:13:28,447 INFO L390 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 [2022-07-13 15:13:28,579 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:13:28,580 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-13 15:13:29,117 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:29,118 INFO L390 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 31 [2022-07-13 15:13:29,122 INFO L390 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 13 treesize of output 9 [2022-07-13 15:13:29,127 INFO L390 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 [2022-07-13 15:13:29,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:29,509 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:13:29,510 INFO L390 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 62 [2022-07-13 15:13:29,532 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:13:29,533 INFO L390 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 30 treesize of output 32 [2022-07-13 15:13:29,574 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:13:29,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-13 15:13:29,585 INFO L390 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 [2022-07-13 15:13:30,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:30,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:13:30,904 INFO L356 Elim1Store]: treesize reduction 152, result has 16.0 percent of original size [2022-07-13 15:13:30,905 INFO L390 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 175 treesize of output 92 [2022-07-13 15:13:30,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:30,931 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:13:30,931 INFO L390 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 121 treesize of output 91 [2022-07-13 15:13:30,968 INFO L356 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2022-07-13 15:13:30,969 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2022-07-13 15:13:30,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:30,986 INFO L390 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 [2022-07-13 15:13:31,207 INFO L390 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 [2022-07-13 15:13:31,432 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:31,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 30 [2022-07-13 15:13:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:13:31,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:31,534 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1524 (_ BitVec 32)) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1525 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_1526)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1529))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_1524)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (_ bv0 32)))) is different from false [2022-07-13 15:13:36,173 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_24| (_ BitVec 32)) (v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1524 (_ BitVec 32)) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse3)) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_24| (_ bv4 32)))) (or (not (= (select .cse0 .cse1) (_ bv0 32))) (not (= (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse3 (store .cse0 .cse1 v_ArrVal_1526)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1529))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse1 v_ArrVal_1524)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32))))))) is different from false [2022-07-13 15:13:36,233 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_24| (_ BitVec 32)) (v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1524 (_ BitVec 32)) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse3)) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_24| (_ bv4 32)))) (or (not (= (select .cse0 .cse1) (_ bv0 32))) (not (= (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse3 (store .cse0 .cse1 v_ArrVal_1526)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1529))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse1 v_ArrVal_1524)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32))))))) is different from false [2022-07-13 15:13:36,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_24| (_ BitVec 32)) (v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1524 (_ BitVec 32)) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse3)) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_24| (_ bv4 32)))) (or (not (= (select .cse0 .cse1) (_ bv0 32))) (not (= (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse3 (store .cse0 .cse1 v_ArrVal_1526)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1529))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse1 v_ArrVal_1524)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32))))))) is different from false [2022-07-13 15:13:37,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [967842301] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:37,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:13:37,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 55 [2022-07-13 15:13:37,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046016228] [2022-07-13 15:13:37,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:13:37,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-13 15:13:37,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:13:37,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-13 15:13:37,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=3385, Unknown=19, NotChecked=1000, Total=4692 [2022-07-13 15:13:37,638 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 55 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 44 states have internal predecessors, (73), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 15:13:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:13:41,580 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-07-13 15:13:41,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 15:13:41,589 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 44 states have internal predecessors, (73), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2022-07-13 15:13:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:13:41,599 INFO L225 Difference]: With dead ends: 46 [2022-07-13 15:13:41,599 INFO L226 Difference]: Without dead ends: 43 [2022-07-13 15:13:41,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=516, Invalid=5817, Unknown=19, NotChecked=1304, Total=7656 [2022-07-13 15:13:41,601 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 47 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 15:13:41,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 279 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 272 Invalid, 0 Unknown, 135 Unchecked, 0.8s Time] [2022-07-13 15:13:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-13 15:13:41,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-07-13 15:13:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:13:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-07-13 15:13:41,608 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 44 [2022-07-13 15:13:41,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:13:41,608 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-07-13 15:13:41,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 44 states have internal predecessors, (73), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 15:13:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-07-13 15:13:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 15:13:41,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:13:41,610 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:13:41,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-13 15:13:41,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-07-13 15:13:42,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-13 15:13:42,023 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:13:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:13:42,024 INFO L85 PathProgramCache]: Analyzing trace with hash 924724691, now seen corresponding path program 1 times [2022-07-13 15:13:42,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:13:42,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189400050] [2022-07-13 15:13:42,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:42,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:13:42,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:13:42,025 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:13:42,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-13 15:13:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:42,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 98 conjunts are in the unsatisfiable core [2022-07-13 15:13:42,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:42,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:13:42,442 INFO L390 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 [2022-07-13 15:13:42,521 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:13:42,522 INFO L390 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 24 [2022-07-13 15:13:42,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:42,558 INFO L390 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 16 treesize of output 17 [2022-07-13 15:13:42,659 INFO L390 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 [2022-07-13 15:13:42,662 INFO L390 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 13 treesize of output 9 [2022-07-13 15:13:42,788 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:13:42,788 INFO L390 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 [2022-07-13 15:13:42,796 INFO L390 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 [2022-07-13 15:13:42,838 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 15:13:42,838 INFO L390 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 24 treesize of output 41 [2022-07-13 15:13:42,934 INFO L390 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 [2022-07-13 15:13:42,944 INFO L390 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 [2022-07-13 15:13:42,959 INFO L390 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 [2022-07-13 15:13:43,049 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:13:43,049 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 85 [2022-07-13 15:13:43,056 INFO L390 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 [2022-07-13 15:13:43,062 INFO L390 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 37 treesize of output 30 [2022-07-13 15:13:43,457 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:13:43,457 INFO L390 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 89 treesize of output 44 [2022-07-13 15:13:43,464 INFO L390 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 [2022-07-13 15:13:43,470 INFO L390 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 [2022-07-13 15:13:43,475 INFO L390 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 23 treesize of output 17 [2022-07-13 15:13:43,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:43,684 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:13:43,684 INFO L390 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 95 treesize of output 77 [2022-07-13 15:13:43,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:43,693 INFO L390 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 [2022-07-13 15:13:43,725 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-13 15:13:43,725 INFO L390 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 40 treesize of output 44 [2022-07-13 15:13:43,742 INFO L390 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 [2022-07-13 15:13:44,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:13:44,539 INFO L356 Elim1Store]: treesize reduction 133, result has 11.9 percent of original size [2022-07-13 15:13:44,539 INFO L390 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 121 [2022-07-13 15:13:44,594 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:13:44,594 INFO L390 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 323 treesize of output 226 [2022-07-13 15:13:44,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:44,605 INFO L390 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 84 [2022-07-13 15:13:44,646 INFO L356 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-07-13 15:13:44,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 175 [2022-07-13 15:13:44,656 INFO L390 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 50 treesize of output 52 [2022-07-13 15:13:45,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:13:45,062 INFO L356 Elim1Store]: treesize reduction 68, result has 10.5 percent of original size [2022-07-13 15:13:45,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 188 treesize of output 78 [2022-07-13 15:13:45,086 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:13:45,086 INFO L390 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 [2022-07-13 15:13:45,197 INFO L390 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 [2022-07-13 15:13:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:13:45,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:45,526 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1655 (_ BitVec 32)) (v_ArrVal_1661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1654) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1661)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1660))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1655)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1663) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-13 15:13:45,601 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1655 (_ BitVec 32)) (v_ArrVal_1661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1663 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1654) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1661)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1660))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1655)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1663) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2022-07-13 15:13:45,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1655 (_ BitVec 32)) (v_ArrVal_1661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7))) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1654) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1661)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1660))) (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 (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1655)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1663) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-13 15:13:45,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1655 (_ BitVec 32)) (v_ArrVal_1661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1663 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7))) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1654) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1661)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1660))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1655)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1663) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2022-07-13 15:13:47,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:13:47,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189400050] [2022-07-13 15:13:47,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189400050] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:47,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1148689920] [2022-07-13 15:13:47,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:47,168 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:13:47,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:13:47,169 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:13:47,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-07-13 15:13:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:47,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-13 15:13:47,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:47,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:13:48,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:48,281 INFO L390 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 16 treesize of output 17 [2022-07-13 15:13:48,585 INFO L390 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 5 [2022-07-13 15:13:48,589 INFO L390 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 [2022-07-13 15:13:49,000 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:13:49,001 INFO L390 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 19 treesize of output 26 [2022-07-13 15:13:49,018 INFO L390 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 [2022-07-13 15:13:49,173 INFO L390 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 [2022-07-13 15:13:49,180 INFO L390 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 [2022-07-13 15:13:49,186 INFO L390 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 [2022-07-13 15:13:49,390 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:13:49,390 INFO L390 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 93 treesize of output 84 [2022-07-13 15:13:49,396 INFO L390 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 22 treesize of output 24 [2022-07-13 15:13:49,401 INFO L390 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 37 treesize of output 30 [2022-07-13 15:13:50,183 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:50,184 INFO L390 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 81 treesize of output 40 [2022-07-13 15:13:50,190 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:50,191 INFO L390 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 [2022-07-13 15:13:50,194 INFO L390 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 16 treesize of output 12 [2022-07-13 15:13:50,197 INFO L390 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 [2022-07-13 15:13:50,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:50,484 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:13:50,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 71 [2022-07-13 15:13:50,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:50,493 INFO L390 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 [2022-07-13 15:13:50,517 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:13:50,518 INFO L390 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 33 treesize of output 35 [2022-07-13 15:13:50,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:50,533 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:13:50,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-13 15:13:51,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:51,709 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:13:51,710 INFO L390 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 178 treesize of output 141 [2022-07-13 15:13:51,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:51,767 INFO L356 Elim1Store]: treesize reduction 66, result has 23.3 percent of original size [2022-07-13 15:13:51,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 96 [2022-07-13 15:13:51,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:13:51,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:51,776 INFO L390 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2022-07-13 15:13:51,784 INFO L390 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 [2022-07-13 15:13:52,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:13:52,405 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:52,405 INFO L390 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 [2022-07-13 15:13:52,420 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-13 15:13:52,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-07-13 15:13:52,602 INFO L390 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 [2022-07-13 15:13:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:13:52,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:52,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1796 (_ BitVec 32)) (v_ArrVal_1794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1799)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1798))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|) v_ArrVal_1796)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1797) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2022-07-13 15:13:52,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1796 (_ BitVec 32)) (v_ArrVal_1794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1795) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1799)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1794) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1798))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1)) v_ArrVal_1796)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1797) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2022-07-13 15:13:52,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1796 (_ BitVec 32)) (v_ArrVal_1794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1795) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1799)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1794) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1798))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) v_ArrVal_1796)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1797) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))) is different from false [2022-07-13 15:13:52,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1796 (_ BitVec 32)) (v_ArrVal_1794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1795) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1799)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1794) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1798))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) v_ArrVal_1796)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1797) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))) is different from false [2022-07-13 15:13:54,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1148689920] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:54,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:13:54,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 53 [2022-07-13 15:13:54,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205456842] [2022-07-13 15:13:54,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:13:54,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-13 15:13:54,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:13:54,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-13 15:13:54,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3222, Unknown=17, NotChecked=968, Total=4422 [2022-07-13 15:13:54,692 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 41 states have internal predecessors, (70), 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) [2022-07-13 15:13:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:13:59,859 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-07-13 15:13:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 15:13:59,859 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 41 states have internal predecessors, (70), 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 44 [2022-07-13 15:13:59,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:13:59,860 INFO L225 Difference]: With dead ends: 46 [2022-07-13 15:13:59,860 INFO L226 Difference]: Without dead ends: 44 [2022-07-13 15:13:59,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1210 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=388, Invalid=5327, Unknown=17, NotChecked=1240, Total=6972 [2022-07-13 15:13:59,862 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 47 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:13:59,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 348 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 372 Invalid, 0 Unknown, 241 Unchecked, 1.0s Time] [2022-07-13 15:13:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-13 15:13:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-07-13 15:13:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:13:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-07-13 15:13:59,867 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 44 [2022-07-13 15:13:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:13:59,867 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-07-13 15:13:59,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 41 states have internal predecessors, (70), 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) [2022-07-13 15:13:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-07-13 15:13:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 15:13:59,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:13:59,868 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:13:59,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-07-13 15:14:00,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-13 15:14:00,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:14:00,268 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:14:00,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:14:00,269 INFO L85 PathProgramCache]: Analyzing trace with hash 478168841, now seen corresponding path program 2 times [2022-07-13 15:14:00,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:14:00,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213671713] [2022-07-13 15:14:00,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:14:00,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:14:00,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:14:00,270 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:14:00,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-13 15:14:00,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 15:14:00,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:14:00,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-13 15:14:00,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:14:00,818 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-13 15:14:00,818 INFO L390 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 34 treesize of output 46 [2022-07-13 15:14:00,849 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-13 15:14:00,849 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 42 [2022-07-13 15:14:00,890 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-13 15:14:00,891 INFO L390 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 61 treesize of output 67 [2022-07-13 15:14:00,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:00,900 INFO L390 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 28 treesize of output 30 [2022-07-13 15:14:00,952 INFO L390 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 16 treesize of output 8 [2022-07-13 15:14:00,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-13 15:14:01,006 INFO L390 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 21 treesize of output 13 [2022-07-13 15:14:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 15:14:01,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:14:01,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:14:01,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213671713] [2022-07-13 15:14:01,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213671713] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:14:01,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:14:01,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 15:14:01,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116708943] [2022-07-13 15:14:01,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:14:01,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 15:14:01,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:14:01,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 15:14:01,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:14:01,027 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:14:01,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:14:01,173 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-07-13 15:14:01,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:14:01,174 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-13 15:14:01,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:14:01,174 INFO L225 Difference]: With dead ends: 48 [2022-07-13 15:14:01,174 INFO L226 Difference]: Without dead ends: 45 [2022-07-13 15:14:01,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-13 15:14:01,175 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:14:01,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 109 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2022-07-13 15:14:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-13 15:14:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-07-13 15:14:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:14:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-07-13 15:14:01,181 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 44 [2022-07-13 15:14:01,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:14:01,182 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-07-13 15:14:01,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:14:01,182 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-07-13 15:14:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 15:14:01,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:14:01,182 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:14:01,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-07-13 15:14:01,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:14:01,391 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:14:01,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:14:01,391 INFO L85 PathProgramCache]: Analyzing trace with hash 478170515, now seen corresponding path program 2 times [2022-07-13 15:14:01,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:14:01,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269621126] [2022-07-13 15:14:01,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:14:01,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:14:01,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:14:01,393 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) [2022-07-13 15:14:01,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-13 15:14:01,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:14:01,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:14:01,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-13 15:14:01,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:14:01,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:14:01,794 INFO L390 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 [2022-07-13 15:14:01,797 INFO L390 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 [2022-07-13 15:14:02,021 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:14:02,022 INFO L390 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 19 treesize of output 26 [2022-07-13 15:14:02,031 INFO L390 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 [2022-07-13 15:14:02,038 INFO L390 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 [2022-07-13 15:14:02,097 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-13 15:14:02,101 INFO L390 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 [2022-07-13 15:14:02,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-13 15:14:02,117 INFO L390 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 [2022-07-13 15:14:02,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:02,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:14:02,214 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:14:02,214 INFO L390 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 1 case distinctions, treesize of input 96 treesize of output 59 [2022-07-13 15:14:02,218 INFO L390 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 0 case distinctions, treesize of input 46 treesize of output 42 [2022-07-13 15:14:02,574 INFO L356 Elim1Store]: treesize reduction 11, result has 66.7 percent of original size [2022-07-13 15:14:02,574 INFO L390 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 82 treesize of output 61 [2022-07-13 15:14:02,581 INFO L390 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 13 treesize of output 9 [2022-07-13 15:14:02,592 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-13 15:14:02,593 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2022-07-13 15:14:02,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:02,764 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-13 15:14:02,764 INFO L390 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 88 treesize of output 78 [2022-07-13 15:14:02,793 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:14:02,794 INFO L390 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 30 treesize of output 32 [2022-07-13 15:14:02,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:02,806 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-13 15:14:02,806 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2022-07-13 15:14:03,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:14:03,297 INFO L356 Elim1Store]: treesize reduction 88, result has 24.1 percent of original size [2022-07-13 15:14:03,298 INFO L390 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 152 treesize of output 103 [2022-07-13 15:14:03,330 INFO L356 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2022-07-13 15:14:03,331 INFO L390 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 6 case distinctions, treesize of input 41 treesize of output 29 [2022-07-13 15:14:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:14:03,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:14:03,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:14:03,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269621126] [2022-07-13 15:14:03,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269621126] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:14:03,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1772207238] [2022-07-13 15:14:03,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:14:03,715 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:14:03,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:14:03,716 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) [2022-07-13 15:14:03,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-07-13 15:14:04,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:14:04,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:14:04,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 112 conjunts are in the unsatisfiable core [2022-07-13 15:14:04,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:14:04,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:14:04,499 INFO L390 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 [2022-07-13 15:14:05,018 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:14:05,019 INFO L390 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 [2022-07-13 15:14:05,023 INFO L390 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 [2022-07-13 15:14:05,051 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:14:05,051 INFO L390 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 19 treesize of output 26 [2022-07-13 15:14:05,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-13 15:14:05,235 INFO L390 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 16 treesize of output 18 [2022-07-13 15:14:05,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:05,248 INFO L390 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 16 treesize of output 17 [2022-07-13 15:14:05,263 INFO L390 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 [2022-07-13 15:14:05,423 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:14:05,423 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 77 [2022-07-13 15:14:05,430 INFO L390 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 20 treesize of output 22 [2022-07-13 15:14:05,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-07-13 15:14:06,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:14:06,079 INFO L390 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 96 treesize of output 51 [2022-07-13 15:14:06,084 INFO L390 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 16 treesize of output 12 [2022-07-13 15:14:06,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:06,096 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:14:06,096 INFO L390 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 [2022-07-13 15:14:06,099 INFO L390 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 [2022-07-13 15:14:08,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:08,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:08,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:08,535 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 15:14:08,535 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 86 [2022-07-13 15:14:08,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:08,576 INFO L390 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 [2022-07-13 15:14:08,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:08,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:08,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:08,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:08,602 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 15:14:08,602 INFO L390 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 [2022-07-13 15:14:08,632 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:14:08,633 INFO L390 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 33 treesize of output 35 [2022-07-13 15:14:11,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:11,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:11,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:14:11,139 INFO L356 Elim1Store]: treesize reduction 269, result has 15.7 percent of original size [2022-07-13 15:14:11,139 INFO L390 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 12 new quantified variables, introduced 19 case distinctions, treesize of input 523 treesize of output 216 [2022-07-13 15:14:11,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:11,196 INFO L356 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2022-07-13 15:14:11,197 INFO L390 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 7 case distinctions, treesize of input 478 treesize of output 334 [2022-07-13 15:14:11,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:11,292 INFO L356 Elim1Store]: treesize reduction 308, result has 10.5 percent of original size [2022-07-13 15:14:11,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 18 case distinctions, treesize of input 451 treesize of output 240 [2022-07-13 15:14:11,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:11,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:11,321 INFO L356 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2022-07-13 15:14:11,322 INFO L390 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 238 treesize of output 209 [2022-07-13 15:14:11,352 INFO L356 Elim1Store]: treesize reduction 67, result has 49.2 percent of original size [2022-07-13 15:14:11,353 INFO L390 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 1 case distinctions, treesize of input 49 treesize of output 85 [2022-07-13 15:14:11,393 INFO L390 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 37 treesize of output 35 [2022-07-13 15:14:11,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:11,727 INFO L356 Elim1Store]: treesize reduction 27, result has 12.9 percent of original size [2022-07-13 15:14:11,727 INFO L390 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 192 treesize of output 71 [2022-07-13 15:14:11,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:11,744 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:14:11,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2022-07-13 15:14:11,913 INFO L390 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 [2022-07-13 15:14:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:14:11,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:14:12,263 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2157 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2160 (_ BitVec 32)) (v_ArrVal_2162 (_ BitVec 32)) (v_ArrVal_2158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2163) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2157) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_2160)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2158) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_2162)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2159) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-13 15:14:43,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1772207238] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:14:43,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:14:43,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 53 [2022-07-13 15:14:43,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939247417] [2022-07-13 15:14:43,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:14:43,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-13 15:14:43,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:14:43,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-13 15:14:43,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=4273, Unknown=30, NotChecked=132, Total=4692 [2022-07-13 15:14:43,792 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 44 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) [2022-07-13 15:14:55,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:14:55,411 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2022-07-13 15:14:55,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-13 15:14:55,412 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 44 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 [2022-07-13 15:14:55,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:14:55,412 INFO L225 Difference]: With dead ends: 79 [2022-07-13 15:14:55,412 INFO L226 Difference]: Without dead ends: 69 [2022-07-13 15:14:55,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2360 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=503, Invalid=7475, Unknown=36, NotChecked=176, Total=8190 [2022-07-13 15:14:55,414 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 58 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 378 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:14:55,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 351 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 328 Invalid, 0 Unknown, 378 Unchecked, 1.3s Time] [2022-07-13 15:14:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-13 15:14:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2022-07-13 15:14:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 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) [2022-07-13 15:14:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2022-07-13 15:14:55,425 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 44 [2022-07-13 15:14:55,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:14:55,425 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2022-07-13 15:14:55,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 44 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) [2022-07-13 15:14:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2022-07-13 15:14:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 15:14:55,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:14:55,426 INFO L195 NwaCegarLoop]: 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, 1] [2022-07-13 15:14:55,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-13 15:14:55,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2022-07-13 15:14:55,841 WARN L477 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 [2022-07-13 15:14:55,842 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:14:55,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:14:55,842 INFO L85 PathProgramCache]: Analyzing trace with hash -397769244, now seen corresponding path program 2 times [2022-07-13 15:14:55,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:14:55,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043005399] [2022-07-13 15:14:55,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:14:55,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:14:55,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:14:55,844 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) [2022-07-13 15:14:55,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-13 15:14:56,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:14:56,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:14:56,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 81 conjunts are in the unsatisfiable core [2022-07-13 15:14:56,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:14:56,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:14:56,245 INFO L390 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 [2022-07-13 15:14:56,318 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:14:56,318 INFO L390 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 24 [2022-07-13 15:14:56,422 INFO L390 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 13 treesize of output 9 [2022-07-13 15:14:56,493 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 15:14:56,493 INFO L390 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 24 treesize of output 41 [2022-07-13 15:14:56,537 INFO L390 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 [2022-07-13 15:14:56,544 INFO L390 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 [2022-07-13 15:14:56,606 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:14:56,606 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-07-13 15:14:56,610 INFO L390 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 [2022-07-13 15:14:56,855 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:14:56,856 INFO L390 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 72 treesize of output 35 [2022-07-13 15:14:56,861 INFO L390 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 [2022-07-13 15:14:56,864 INFO L390 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 20 treesize of output 14 [2022-07-13 15:14:57,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:57,018 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:14:57,018 INFO L390 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 78 treesize of output 66 [2022-07-13 15:14:57,041 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-13 15:14:57,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2022-07-13 15:14:57,047 INFO L390 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 [2022-07-13 15:14:57,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:14:57,626 INFO L356 Elim1Store]: treesize reduction 133, result has 11.9 percent of original size [2022-07-13 15:14:57,626 INFO L390 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 105 [2022-07-13 15:14:57,667 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:14:57,668 INFO L390 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 295 treesize of output 210 [2022-07-13 15:14:57,675 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:14:57,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 164 [2022-07-13 15:14:57,711 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-13 15:14:57,712 INFO L390 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 192 treesize of output 160 [2022-07-13 15:14:58,024 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:14:58,024 INFO L390 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 1 case distinctions, treesize of input 192 treesize of output 114 [2022-07-13 15:14:58,217 INFO L356 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-07-13 15:14:58,217 INFO L390 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 111 treesize of output 37 [2022-07-13 15:14:58,291 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:14:58,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:14:58,609 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_2288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2286 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2288)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2286))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (bvadd (select (select .cse3 .cse1) .cse2) (_ bv4 32)))))) (_ bv0 32)))) is different from false [2022-07-13 15:14:58,681 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_2288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2286 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6)))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2288)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2286))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (bvadd (_ bv4 32) (select (select .cse3 .cse1) .cse2))))))) (_ bv0 32)))) is different from false [2022-07-13 15:14:58,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_2288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2286 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2288)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2286))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (bvadd (_ bv4 32) (select (select .cse3 .cse1) .cse2))))))) (_ bv0 32)))) is different from false [2022-07-13 15:14:58,767 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_2288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2286 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2288)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2286))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (bvadd (select (select .cse3 .cse1) .cse2) (_ bv4 32))))))) (_ bv0 32)))) is different from false [2022-07-13 15:14:59,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:14:59,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043005399] [2022-07-13 15:14:59,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043005399] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:14:59,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [326455949] [2022-07-13 15:14:59,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:14:59,561 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:14:59,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:14:59,562 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) [2022-07-13 15:14:59,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-07-13 15:15:00,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:15:00,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:15:00,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-13 15:15:00,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:15:00,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:15:01,044 INFO L390 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 5 [2022-07-13 15:15:01,362 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:15:01,362 INFO L390 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 19 treesize of output 26 [2022-07-13 15:15:01,513 INFO L390 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 [2022-07-13 15:15:01,520 INFO L390 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 [2022-07-13 15:15:01,705 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:15:01,705 INFO L390 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 57 treesize of output 54 [2022-07-13 15:15:01,711 INFO L390 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 22 treesize of output 24 [2022-07-13 15:15:02,429 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:15:02,430 INFO L390 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 33 [2022-07-13 15:15:02,441 INFO L390 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 16 treesize of output 12 [2022-07-13 15:15:02,448 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:15:02,448 INFO L390 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 [2022-07-13 15:15:02,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:02,897 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:15:02,897 INFO L390 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 72 treesize of output 62 [2022-07-13 15:15:02,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:02,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:02,912 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:15:02,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-13 15:15:02,936 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:15:02,936 INFO L390 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 33 treesize of output 35 [2022-07-13 15:15:03,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:03,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:03,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:03,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:15:04,023 INFO L356 Elim1Store]: treesize reduction 121, result has 20.4 percent of original size [2022-07-13 15:15:04,023 INFO L390 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 6 new quantified variables, introduced 7 case distinctions, treesize of input 211 treesize of output 90 [2022-07-13 15:15:04,083 INFO L356 Elim1Store]: treesize reduction 114, result has 14.9 percent of original size [2022-07-13 15:15:04,083 INFO L390 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 4 case distinctions, treesize of input 322 treesize of output 245 [2022-07-13 15:15:04,627 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-07-13 15:15:04,627 INFO L390 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 271 treesize of output 133 [2022-07-13 15:15:05,062 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-13 15:15:05,062 INFO L390 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 8 new quantified variables, introduced 10 case distinctions, treesize of input 112 treesize of output 48 [2022-07-13 15:15:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:15:05,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:15:05,646 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2405) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2407)) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)))) (store .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) |c_ULTIMATE.start_dll_append_~last~0#1.base|))))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse1 (select (select .cse2 .cse4) .cse5)) (.cse0 (select (select .cse3 .cse4) .cse5))) (or (and (= .cse0 (_ bv0 32)) (= .cse1 (_ bv0 32))) (not (= (_ bv0 32) (select (select .cse2 .cse1) (bvadd (_ bv4 32) .cse0))))))))) is different from false [2022-07-13 15:15:05,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse8))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_2405) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2407)) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse8)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)))) (store .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) .cse7))))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse1 (select (select .cse2 .cse4) .cse5)) (.cse0 (select (select .cse3 .cse4) .cse5))) (or (and (= .cse0 (_ bv0 32)) (= .cse1 (_ bv0 32))) (not (= (_ bv0 32) (select (select .cse2 .cse1) (bvadd (_ bv4 32) .cse0))))))))))) is different from false [2022-07-13 15:15:05,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse9 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_2405) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2407)) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)))) (store .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) .cse7))))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse1 (select (select .cse2 .cse4) .cse5)) (.cse0 (select (select .cse3 .cse4) .cse5))) (or (and (= .cse0 (_ bv0 32)) (= .cse1 (_ bv0 32))) (not (= (_ bv0 32) (select (select .cse2 .cse1) (bvadd .cse0 (_ bv4 32)))))))))))) is different from false [2022-07-13 15:15:06,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse9 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_2405) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2407)) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)))) (store .cse6 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|) .cse7))))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse1 (select (select .cse2 .cse4) .cse5)) (.cse0 (select (select .cse3 .cse4) .cse5))) (or (and (= .cse0 (_ bv0 32)) (= .cse1 (_ bv0 32))) (not (= (select (select .cse2 .cse1) (bvadd .cse0 (_ bv4 32))) (_ bv0 32)))))))))) is different from false [2022-07-13 15:15:10,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [326455949] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:15:10,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:15:10,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 53 [2022-07-13 15:15:10,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423224754] [2022-07-13 15:15:10,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:15:10,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-13 15:15:10,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:15:10,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-13 15:15:10,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3563, Unknown=20, NotChecked=1016, Total=4830 [2022-07-13 15:15:10,596 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 53 states, 51 states have (on average 1.411764705882353) internal successors, (72), 42 states have internal predecessors, (72), 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) [2022-07-13 15:15:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:15:15,111 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-07-13 15:15:15,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 15:15:15,111 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.411764705882353) internal successors, (72), 42 states have internal predecessors, (72), 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 46 [2022-07-13 15:15:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:15:15,112 INFO L225 Difference]: With dead ends: 73 [2022-07-13 15:15:15,112 INFO L226 Difference]: Without dead ends: 70 [2022-07-13 15:15:15,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=414, Invalid=6078, Unknown=20, NotChecked=1320, Total=7832 [2022-07-13 15:15:15,113 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 39 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 15:15:15,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 435 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 291 Invalid, 0 Unknown, 238 Unchecked, 0.9s Time] [2022-07-13 15:15:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-13 15:15:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-07-13 15:15:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 60 states have internal predecessors, (67), 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) [2022-07-13 15:15:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-13 15:15:15,122 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 46 [2022-07-13 15:15:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:15:15,122 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-13 15:15:15,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.411764705882353) internal successors, (72), 42 states have internal predecessors, (72), 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) [2022-07-13 15:15:15,122 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-13 15:15:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 15:15:15,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:15:15,123 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:15:15,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2022-07-13 15:15:15,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-13 15:15:15,531 WARN L477 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 [2022-07-13 15:15:15,532 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:15:15,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:15:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash -397767570, now seen corresponding path program 2 times [2022-07-13 15:15:15,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:15:15,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23848478] [2022-07-13 15:15:15,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:15:15,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:15:15,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:15:15,535 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) [2022-07-13 15:15:15,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-13 15:15:15,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:15:15,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:15:15,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-13 15:15:15,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:15:15,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:15:15,983 INFO L390 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 [2022-07-13 15:15:16,047 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:15:16,048 INFO L390 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 24 [2022-07-13 15:15:16,154 INFO L390 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 13 treesize of output 9 [2022-07-13 15:15:16,210 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 15:15:16,210 INFO L390 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 24 treesize of output 41 [2022-07-13 15:15:16,271 INFO L390 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 [2022-07-13 15:15:16,283 INFO L390 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 [2022-07-13 15:15:16,353 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:15:16,354 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-07-13 15:15:16,358 INFO L390 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 [2022-07-13 15:15:16,678 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:15:16,679 INFO L390 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 72 treesize of output 35 [2022-07-13 15:15:16,684 INFO L390 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 [2022-07-13 15:15:16,690 INFO L390 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 20 treesize of output 14 [2022-07-13 15:15:16,781 INFO L390 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 [2022-07-13 15:15:16,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:16,865 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:15:16,866 INFO L390 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 78 treesize of output 66 [2022-07-13 15:15:16,895 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-13 15:15:16,895 INFO L390 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 37 treesize of output 41 [2022-07-13 15:15:16,901 INFO L390 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 [2022-07-13 15:15:17,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:15:17,690 INFO L356 Elim1Store]: treesize reduction 127, result has 15.9 percent of original size [2022-07-13 15:15:17,691 INFO L390 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 229 treesize of output 128 [2022-07-13 15:15:17,757 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:15:17,758 INFO L390 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 477 treesize of output 314 [2022-07-13 15:15:17,801 INFO L356 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2022-07-13 15:15:17,802 INFO L390 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 7 new quantified variables, introduced 4 case distinctions, treesize of input 436 treesize of output 285 [2022-07-13 15:15:17,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:17,813 INFO L390 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 96 treesize of output 49 [2022-07-13 15:15:17,851 INFO L356 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-07-13 15:15:17,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 166 [2022-07-13 15:15:17,860 INFO L390 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 36 treesize of output 62 [2022-07-13 15:15:18,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:15:18,472 INFO L356 Elim1Store]: treesize reduction 119, result has 8.5 percent of original size [2022-07-13 15:15:18,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 249 treesize of output 112 [2022-07-13 15:15:18,497 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-13 15:15:18,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 34 [2022-07-13 15:15:18,572 INFO L390 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 [2022-07-13 15:15:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:15:18,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:15:19,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2532 (_ BitVec 32)) (v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2538)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2535))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (bvadd (_ bv4 32) (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 .cse5) .cse6)))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2531))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) v_ArrVal_2532))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-13 15:15:19,267 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2532 (_ BitVec 32)) (v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9)) (.cse8 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9)))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2538)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2535))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 .cse6) .cse7)))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_2531))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) v_ArrVal_2532))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-13 15:15:19,407 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2532 (_ BitVec 32)) (v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse10 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse9) .cse10)) (.cse8 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10)))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2538)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2535))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 .cse6) .cse7)))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_2531))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) v_ArrVal_2532))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2022-07-13 15:15:19,543 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2532 (_ BitVec 32)) (v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse10 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse9) .cse10)) (.cse8 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10)))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2538)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2535))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (bvadd (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 .cse6) .cse7)))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_2531))) (store .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|) v_ArrVal_2532))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2022-07-13 15:15:19,735 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:15:19,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1383 treesize of output 1376 [2022-07-13 15:15:19,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:15:19,809 INFO L390 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 14576 treesize of output 13924 [2022-07-13 15:15:19,863 INFO L390 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 15880 treesize of output 13272 [2022-07-13 15:15:24,873 INFO L390 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 655 treesize of output 3 [2022-07-13 15:15:26,309 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:15:26,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3311 treesize of output 3315 [2022-07-13 15:16:04,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:16:04,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23848478] [2022-07-13 15:16:04,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23848478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:16:04,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [577363174] [2022-07-13 15:16:04,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:16:04,578 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:16:04,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:16:04,580 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:16:04,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-07-13 15:16:05,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:16:05,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:16:05,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 111 conjunts are in the unsatisfiable core [2022-07-13 15:16:05,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:16:05,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:16:07,506 INFO L390 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 [2022-07-13 15:16:07,594 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:16:07,594 INFO L390 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 24 [2022-07-13 15:16:11,824 INFO L390 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 13 treesize of output 9 [2022-07-13 15:16:11,916 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 15:16:11,916 INFO L390 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 24 treesize of output 41 [2022-07-13 15:16:14,108 INFO L390 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 [2022-07-13 15:16:14,125 INFO L390 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 [2022-07-13 15:16:16,225 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:16:16,225 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-07-13 15:16:16,232 INFO L390 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 [2022-07-13 15:16:22,870 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:16:22,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 38 [2022-07-13 15:16:22,878 INFO L390 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 [2022-07-13 15:16:22,886 INFO L390 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 24 treesize of output 18 [2022-07-13 15:16:22,965 INFO L390 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 [2022-07-13 15:16:23,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:23,102 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:16:23,102 INFO L390 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 81 treesize of output 69 [2022-07-13 15:16:23,148 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-13 15:16:23,148 INFO L390 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 41 treesize of output 45 [2022-07-13 15:16:23,159 INFO L390 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