./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_unequal.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_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:12:04,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:12:04,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:12:04,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:12:04,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:12:04,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:12:04,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:12:04,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:12:04,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:12:04,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:12:04,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:12:04,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:12:04,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:12:04,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:12:04,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:12:04,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:12:04,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:12:04,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:12:04,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:12:04,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:12:04,904 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:12:04,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:12:04,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:12:04,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:12:04,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:12:04,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:12:04,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:12:04,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:12:04,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:12:04,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:12:04,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:12:04,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:12:04,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:12:04,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:12:04,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:12:04,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:12:04,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:12:04,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:12:04,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:12:04,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:12:04,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:12:04,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:12:04,918 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:04,936 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:12:04,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:12:04,937 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:12:04,937 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:12:04,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:12:04,938 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:12:04,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:12:04,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:12:04,938 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:12:04,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:12:04,939 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:12:04,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:12:04,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:12:04,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:12:04,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:12:04,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:12:04,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:12:04,942 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:12:04,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:12:04,942 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:12:04,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:12:04,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:12:04,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:12:04,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:12:04,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:12:04,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:12:04,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:12:04,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:12:04,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:12:04,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:12:04,945 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:12:04,945 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:12:04,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:12:04,946 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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2022-07-13 15:12:05,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:12:05,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:12:05,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:12:05,159 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:12:05,160 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:12:05,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-07-13 15:12:05,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158f5610f/d8f0ee1c71be40f0acd85f2255936b17/FLAG502fc396f [2022-07-13 15:12:05,668 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:12:05,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-07-13 15:12:05,681 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158f5610f/d8f0ee1c71be40f0acd85f2255936b17/FLAG502fc396f [2022-07-13 15:12:06,031 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158f5610f/d8f0ee1c71be40f0acd85f2255936b17 [2022-07-13 15:12:06,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:12:06,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:12:06,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:12:06,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:12:06,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:12:06,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:12:06" (1/1) ... [2022-07-13 15:12:06,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3042584d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:06, skipping insertion in model container [2022-07-13 15:12:06,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:12:06" (1/1) ... [2022-07-13 15:12:06,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:12:06,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:12:06,337 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_unequal.i[24457,24470] [2022-07-13 15:12:06,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:12:06,345 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:12:06,377 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_unequal.i[24457,24470] [2022-07-13 15:12:06,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:12:06,404 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:12:06,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:06 WrapperNode [2022-07-13 15:12:06,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:12:06,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:12:06,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:12:06,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:12:06,412 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:06" (1/1) ... [2022-07-13 15:12:06,439 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:06" (1/1) ... [2022-07-13 15:12:06,468 INFO L137 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2022-07-13 15:12:06,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:12:06,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:12:06,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:12:06,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:12:06,477 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:06" (1/1) ... [2022-07-13 15:12:06,477 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:06" (1/1) ... [2022-07-13 15:12:06,481 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:06" (1/1) ... [2022-07-13 15:12:06,482 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:06" (1/1) ... [2022-07-13 15:12:06,487 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:06" (1/1) ... [2022-07-13 15:12:06,490 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:06" (1/1) ... [2022-07-13 15:12:06,491 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:06" (1/1) ... [2022-07-13 15:12:06,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:12:06,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:12:06,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:12:06,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:12:06,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:06" (1/1) ... [2022-07-13 15:12:06,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:12:06,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:06,537 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:06,556 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:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 15:12:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 15:12:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-13 15:12:06,572 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-13 15:12:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:12:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:12:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 15:12:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:12:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:12:06,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:12:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 15:12:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:12:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:12:06,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:12:06,704 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:12:06,705 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:12:06,902 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:12:06,907 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:12:06,907 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 15:12:06,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:12:06 BoogieIcfgContainer [2022-07-13 15:12:06,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:12:06,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:12:06,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:12:06,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:12:06,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:12:06" (1/3) ... [2022-07-13 15:12:06,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63fc9f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:12:06, skipping insertion in model container [2022-07-13 15:12:06,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:12:06" (2/3) ... [2022-07-13 15:12:06,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63fc9f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:12:06, skipping insertion in model container [2022-07-13 15:12:06,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:12:06" (3/3) ... [2022-07-13 15:12:06,922 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2022-07-13 15:12:06,934 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:12:06,935 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:12:06,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:12:07,002 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@29d9fe96, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@d299aca [2022-07-13 15:12:07,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:12:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 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:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 15:12:07,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:07,018 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:07,019 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:07,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:07,025 INFO L85 PathProgramCache]: Analyzing trace with hash -346371136, now seen corresponding path program 1 times [2022-07-13 15:12:07,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:07,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448669068] [2022-07-13 15:12:07,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:07,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:07,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 15:12:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:07,256 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:07,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:07,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448669068] [2022-07-13 15:12:07,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448669068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:12:07,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:12:07,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:12:07,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82451459] [2022-07-13 15:12:07,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:12:07,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:12:07,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:07,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:12:07,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:12:07,298 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 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:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:07,371 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2022-07-13 15:12:07,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:12:07,374 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:07,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:07,382 INFO L225 Difference]: With dead ends: 65 [2022-07-13 15:12:07,382 INFO L226 Difference]: Without dead ends: 30 [2022-07-13 15:12:07,384 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:07,388 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:07,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:12:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-13 15:12:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-13 15:12:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 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:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-07-13 15:12:07,425 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-07-13 15:12:07,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:07,425 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-07-13 15:12:07,425 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:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-07-13 15:12:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 15:12:07,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:07,427 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:07,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:12:07,427 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:07,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:07,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1530291827, now seen corresponding path program 1 times [2022-07-13 15:12:07,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:07,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20633788] [2022-07-13 15:12:07,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:07,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:07,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 15:12:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:07,550 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:07,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:07,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20633788] [2022-07-13 15:12:07,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20633788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:12:07,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:12:07,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:12:07,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784239102] [2022-07-13 15:12:07,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:12:07,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:12:07,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:07,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:12:07,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:12:07,554 INFO L87 Difference]: Start difference. First operand 30 states and 38 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:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:07,599 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-07-13 15:12:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:12:07,600 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:07,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:07,601 INFO L225 Difference]: With dead ends: 58 [2022-07-13 15:12:07,601 INFO L226 Difference]: Without dead ends: 35 [2022-07-13 15:12:07,602 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:07,603 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:07,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:12:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-13 15:12:07,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-07-13 15:12:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-13 15:12:07,611 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2022-07-13 15:12:07,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:07,611 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-13 15:12:07,611 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:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-13 15:12:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:12:07,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:07,613 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:07,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:12:07,613 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:07,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:07,614 INFO L85 PathProgramCache]: Analyzing trace with hash 878865159, now seen corresponding path program 1 times [2022-07-13 15:12:07,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:07,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820612288] [2022-07-13 15:12:07,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:07,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:07,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:07,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 15:12:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:07,729 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:07,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:07,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820612288] [2022-07-13 15:12:07,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820612288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:12:07,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:12:07,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:12:07,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567980219] [2022-07-13 15:12:07,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:12:07,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:12:07,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:07,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:12:07,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:12:07,733 INFO L87 Difference]: Start difference. First operand 31 states and 39 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:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:07,774 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2022-07-13 15:12:07,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:12:07,775 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:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:07,776 INFO L225 Difference]: With dead ends: 63 [2022-07-13 15:12:07,776 INFO L226 Difference]: Without dead ends: 35 [2022-07-13 15:12:07,777 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:07,778 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:07,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:12:07,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-13 15:12:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-07-13 15:12:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:12:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-07-13 15:12:07,784 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 27 [2022-07-13 15:12:07,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:07,785 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-13 15:12:07,785 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:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-07-13 15:12:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:12:07,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:07,786 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:07,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:12:07,787 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:07,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:07,787 INFO L85 PathProgramCache]: Analyzing trace with hash -709482743, now seen corresponding path program 1 times [2022-07-13 15:12:07,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:07,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341417056] [2022-07-13 15:12:07,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:07,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:07,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:07,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 15:12:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:07,881 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:07,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:07,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341417056] [2022-07-13 15:12:07,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341417056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:07,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452011202] [2022-07-13 15:12:07,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:07,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:07,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:07,885 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:12:07,893 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:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:08,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:12:08,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:08,055 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:08,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:08,081 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:08,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452011202] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:12:08,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:12:08,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-07-13 15:12:08,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112078114] [2022-07-13 15:12:08,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:08,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:12:08,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:08,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:12:08,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:12:08,084 INFO L87 Difference]: Start difference. First operand 34 states and 43 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:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:08,128 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-07-13 15:12:08,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:12:08,128 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:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:08,129 INFO L225 Difference]: With dead ends: 59 [2022-07-13 15:12:08,129 INFO L226 Difference]: Without dead ends: 36 [2022-07-13 15:12:08,130 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:08,131 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:08,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:12:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-13 15:12:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-13 15:12:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 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:12:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-07-13 15:12:08,136 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2022-07-13 15:12:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:08,136 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-07-13 15:12:08,136 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:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-07-13 15:12:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:12:08,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:08,138 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:08,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 15:12:08,361 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:08,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:08,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:08,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1607276515, now seen corresponding path program 1 times [2022-07-13 15:12:08,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:08,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611552595] [2022-07-13 15:12:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:08,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:08,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:08,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:08,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:08,732 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:08,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:08,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611552595] [2022-07-13 15:12:08,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611552595] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:08,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424109917] [2022-07-13 15:12:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:08,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:08,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:08,735 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:08,737 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:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:08,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-13 15:12:08,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:09,201 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:09,246 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_520 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_520) |c_#memory_$Pointer$.base|)))) is different from true [2022-07-13 15:12:09,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:09,272 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 24 treesize of output 24 [2022-07-13 15:12:09,304 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 13 [2022-07-13 15:12:09,324 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:09,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:09,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_523 (Array Int Int)) (|v_node_create_~temp~0#1.base_13| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_13| v_ArrVal_523) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (<= 1 .cse0) (not (< |v_node_create_~temp~0#1.base_13| |c_#StackHeapBarrier|))))) is different from false [2022-07-13 15:12:09,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424109917] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:09,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:09,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-07-13 15:12:09,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487990465] [2022-07-13 15:12:09,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:09,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 15:12:09,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:09,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 15:12:09,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=525, Unknown=2, NotChecked=94, Total=702 [2022-07-13 15:12:09,400 INFO L87 Difference]: Start difference. First operand 36 states and 45 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:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:09,772 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-07-13 15:12:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:12:09,772 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:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:09,773 INFO L225 Difference]: With dead ends: 46 [2022-07-13 15:12:09,773 INFO L226 Difference]: Without dead ends: 36 [2022-07-13 15:12:09,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=856, Unknown=2, NotChecked=122, Total=1122 [2022-07-13 15:12:09,775 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:09,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 192 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 147 Invalid, 0 Unknown, 38 Unchecked, 0.2s Time] [2022-07-13 15:12:09,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-13 15:12:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-13 15:12:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-13 15:12:09,786 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 37 [2022-07-13 15:12:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:09,787 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-13 15:12:09,787 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:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-13 15:12:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 15:12:09,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:09,788 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:09,814 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:10,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:10,012 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:10,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:10,012 INFO L85 PathProgramCache]: Analyzing trace with hash -859241559, now seen corresponding path program 1 times [2022-07-13 15:12:10,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:10,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783587710] [2022-07-13 15:12:10,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:10,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:10,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:10,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:10,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:12:10,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:10,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783587710] [2022-07-13 15:12:10,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783587710] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:10,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486812554] [2022-07-13 15:12:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:10,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:10,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:10,636 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:10,638 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:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:10,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-13 15:12:10,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:10,803 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:10,850 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:10,936 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:12:10,936 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:11,075 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:12:11,076 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:11,180 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-13 15:12:11,181 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:11,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, 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:11,316 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:12:11,316 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:11,611 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-13 15:12:11,612 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 85 treesize of output 30 [2022-07-13 15:12:11,635 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:12:11,635 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:11,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:11,812 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:12:11,813 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 91 treesize of output 79 [2022-07-13 15:12:11,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:11,820 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 66 treesize of output 64 [2022-07-13 15:12:11,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:11,840 INFO L356 Elim1Store]: treesize reduction 30, result has 47.4 percent of original size [2022-07-13 15:12:11,840 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 39 treesize of output 39 [2022-07-13 15:12:12,125 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-13 15:12:12,125 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 75 treesize of output 69 [2022-07-13 15:12:12,166 INFO L356 Elim1Store]: treesize reduction 126, result has 14.3 percent of original size [2022-07-13 15:12:12,167 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 108 treesize of output 66 [2022-07-13 15:12:12,200 INFO L356 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-07-13 15:12:12,201 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 130 treesize of output 120 [2022-07-13 15:12:12,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:12,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 71 [2022-07-13 15:12:12,229 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 44 treesize of output 32 [2022-07-13 15:12:12,293 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-13 15:12:12,293 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 74 treesize of output 23 [2022-07-13 15:12:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:12:12,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:14,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486812554] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:14,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:14,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 46 [2022-07-13 15:12:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553677458] [2022-07-13 15:12:14,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:14,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-13 15:12:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:14,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-13 15:12:14,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2452, Unknown=14, NotChecked=0, Total=2652 [2022-07-13 15:12:14,650 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 38 states have internal predecessors, (65), 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:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:15,940 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-07-13 15:12:15,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 15:12:15,941 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 38 states have internal predecessors, (65), 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 40 [2022-07-13 15:12:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:15,943 INFO L225 Difference]: With dead ends: 67 [2022-07-13 15:12:15,943 INFO L226 Difference]: Without dead ends: 39 [2022-07-13 15:12:15,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=356, Invalid=4052, Unknown=14, NotChecked=0, Total=4422 [2022-07-13 15:12:15,946 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:15,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 424 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 679 Invalid, 0 Unknown, 10 Unchecked, 0.4s Time] [2022-07-13 15:12:15,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-13 15:12:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-07-13 15:12:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:12:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-07-13 15:12:15,952 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 40 [2022-07-13 15:12:15,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:15,953 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-07-13 15:12:15,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 38 states have internal predecessors, (65), 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:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-07-13 15:12:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 15:12:15,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:15,954 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:15,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 15:12:16,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:16,160 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:16,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1146227584, now seen corresponding path program 1 times [2022-07-13 15:12:16,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:16,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059446410] [2022-07-13 15:12:16,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:16,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:17,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:17,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:17,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:17,527 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:17,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:17,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059446410] [2022-07-13 15:12:17,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059446410] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:17,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230744415] [2022-07-13 15:12:17,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:17,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:17,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:17,530 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:17,531 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:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:17,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 143 conjunts are in the unsatisfiable core [2022-07-13 15:12:17,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:17,922 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,178 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,352 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 15:12:18,353 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:18,441 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:18,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:18,458 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:12:18,551 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:12:18,551 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 55 treesize of output 52 [2022-07-13 15:12:18,556 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:12:18,965 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:12:18,966 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 76 treesize of output 35 [2022-07-13 15:12:18,975 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 11 treesize of output 7 [2022-07-13 15:12:18,982 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:18,990 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:19,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:19,212 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:12:19,212 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 86 treesize of output 72 [2022-07-13 15:12:19,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:19,219 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:12:19,234 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:12:19,235 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:19,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:19,261 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:19,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:12:19,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:20,015 INFO L356 Elim1Store]: treesize reduction 153, result has 15.5 percent of original size [2022-07-13 15:12:20,016 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 212 treesize of output 110 [2022-07-13 15:12:20,047 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:12:20,047 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 276 treesize of output 167 [2022-07-13 15:12:20,064 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-13 15:12:20,064 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 200 treesize of output 163 [2022-07-13 15:12:20,090 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-13 15:12:20,090 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 185 treesize of output 182 [2022-07-13 15:12:20,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:20,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:20,099 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:12:20,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:12:20,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:20,255 INFO L356 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-07-13 15:12:20,255 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 173 treesize of output 60 [2022-07-13 15:12:20,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:20,263 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 0 case distinctions, treesize of input 24 treesize of output 10 [2022-07-13 15:12:20,350 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:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:12:20,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:20,419 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1031 (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_1036) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1038) (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 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1031) |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 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1033) |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:20,667 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_10| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1031 (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_10| 4))) (or (not (= (select .cse0 .cse1) 0)) (= (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_1036) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1038) (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_1031) |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_1033) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2022-07-13 15:12:20,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_10| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1031 (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_10| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1036) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1038) (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_1031) |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_1033) |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:20,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_10| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1031 (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_10| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1036) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1038) (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_1031) |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_1033) |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:20,809 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| Int) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_10| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1031 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1052)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1051))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_10| 4))) (or (= (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1053) .cse0 v_ArrVal_1036) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1038) (select (select (store (store .cse1 .cse0 (store .cse2 .cse3 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1031) |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_16| v_ArrVal_1033) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| |c_#StackHeapBarrier|)) (not (= (select .cse2 .cse3) 0))))))) is different from false [2022-07-13 15:12:20,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230744415] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:20,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:20,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 54 [2022-07-13 15:12:20,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027968181] [2022-07-13 15:12:20,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:20,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-13 15:12:20,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:20,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-13 15:12:20,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2913, Unknown=6, NotChecked=560, Total=3660 [2022-07-13 15:12:20,814 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 54 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 45 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:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:23,320 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-07-13 15:12:23,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 15:12:23,321 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 45 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:23,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:23,322 INFO L225 Difference]: With dead ends: 54 [2022-07-13 15:12:23,322 INFO L226 Difference]: Without dead ends: 52 [2022-07-13 15:12:23,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=382, Invalid=5182, Unknown=6, NotChecked=750, Total=6320 [2022-07-13 15:12:23,326 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 56 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:23,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 452 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 961 Invalid, 0 Unknown, 61 Unchecked, 0.7s Time] [2022-07-13 15:12:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-13 15:12:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-07-13 15:12:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-07-13 15:12:23,335 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 44 [2022-07-13 15:12:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:23,335 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-07-13 15:12:23,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 45 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:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-07-13 15:12:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 15:12:23,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:23,337 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, 1] [2022-07-13 15:12:23,365 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:23,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:23,563 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:23,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:23,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1173262244, now seen corresponding path program 1 times [2022-07-13 15:12:23,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:23,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081003005] [2022-07-13 15:12:23,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:23,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:23,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:23,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:23,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 15:12:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:23,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081003005] [2022-07-13 15:12:23,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081003005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:12:23,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:12:23,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:12:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275569912] [2022-07-13 15:12:23,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:12:23,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:12:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:23,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:12:23,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:12:23,659 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 15:12:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:23,734 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-07-13 15:12:23,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:12:23,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-13 15:12:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:23,736 INFO L225 Difference]: With dead ends: 56 [2022-07-13 15:12:23,737 INFO L226 Difference]: Without dead ends: 51 [2022-07-13 15:12:23,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:12:23,738 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:23,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:12:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-13 15:12:23,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2022-07-13 15:12:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 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:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-07-13 15:12:23,763 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 45 [2022-07-13 15:12:23,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:23,764 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-07-13 15:12:23,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 15:12:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-07-13 15:12:23,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 15:12:23,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:23,768 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, 1, 1] [2022-07-13 15:12:23,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 15:12:23,768 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:23,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:23,769 INFO L85 PathProgramCache]: Analyzing trace with hash -731397669, now seen corresponding path program 2 times [2022-07-13 15:12:23,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:23,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153809978] [2022-07-13 15:12:23,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:23,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:24,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:24,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:24,702 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:24,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:24,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153809978] [2022-07-13 15:12:24,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153809978] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:24,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313049074] [2022-07-13 15:12:24,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:12:24,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:24,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:24,706 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:24,707 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:24,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:12:24,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:12:24,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-13 15:12:24,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:24,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:12:25,056 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:25,067 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:25,382 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 15:12:25,382 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:25,392 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:12:25,409 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:12:25,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, 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:25,500 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:12:25,509 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:12:25,517 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:12:25,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:25,527 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:12:25,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:25,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:25,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:12:25,633 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:12:25,634 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 1 case distinctions, treesize of input 128 treesize of output 91 [2022-07-13 15:12:25,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:25,640 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:12:25,663 INFO L356 Elim1Store]: treesize reduction 84, result has 21.5 percent of original size [2022-07-13 15:12:25,663 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 3 case distinctions, treesize of input 92 treesize of output 70 [2022-07-13 15:12:26,030 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-07-13 15:12:26,031 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 114 treesize of output 71 [2022-07-13 15:12:26,040 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:12:26,041 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 2 case distinctions, treesize of input 35 treesize of output 18 [2022-07-13 15:12:26,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:26,276 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-13 15:12:26,277 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 120 treesize of output 108 [2022-07-13 15:12:26,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:26,284 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:12:26,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:26,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:26,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:26,298 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-13 15:12:26,298 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 3 case distinctions, treesize of input 86 treesize of output 76 [2022-07-13 15:12:26,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:26,318 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:12:26,318 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:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:12:26,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:26,976 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (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_1463) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1464) (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 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1465) |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 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1466) |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:27,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1484 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| Int) (v_ArrVal_1482 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_14| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| v_ArrVal_1482)) (.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| v_ArrVal_1483))) (let ((.cse7 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse5 (select (select .cse3 .cse7) .cse8)) (.cse6 (+ (select (select .cse4 .cse7) .cse8) 4))) (let ((.cse2 (select (select .cse3 .cse5) .cse6))) (let ((.cse0 (select .cse3 .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_14| 4))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19|) 0)) (not (= 0 (select .cse0 .cse1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| v_ArrVal_1484) .cse2 v_ArrVal_1463) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| v_ArrVal_1464) (select (select (store (store .cse3 .cse2 (store .cse0 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| v_ArrVal_1465) |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 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| v_ArrVal_1466) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= .cse2 0) (= (select (select .cse4 .cse5) .cse6) 0))))))))) is different from false [2022-07-13 15:12:27,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313049074] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:27,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:27,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 45 [2022-07-13 15:12:27,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038602356] [2022-07-13 15:12:27,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:27,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-13 15:12:27,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:27,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-13 15:12:27,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2783, Unknown=5, NotChecked=214, Total=3192 [2022-07-13 15:12:27,855 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 45 states, 43 states have (on average 1.558139534883721) internal successors, (67), 37 states have internal predecessors, (67), 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:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:29,043 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-07-13 15:12:29,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 15:12:29,044 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.558139534883721) internal successors, (67), 37 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-07-13 15:12:29,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:29,044 INFO L225 Difference]: With dead ends: 79 [2022-07-13 15:12:29,044 INFO L226 Difference]: Without dead ends: 64 [2022-07-13 15:12:29,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=312, Invalid=4113, Unknown=5, NotChecked=262, Total=4692 [2022-07-13 15:12:29,046 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:29,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 391 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 648 Invalid, 0 Unknown, 68 Unchecked, 0.5s Time] [2022-07-13 15:12:29,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-13 15:12:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-07-13 15:12:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 15:12:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-07-13 15:12:29,056 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 46 [2022-07-13 15:12:29,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:29,056 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-07-13 15:12:29,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.558139534883721) internal successors, (67), 37 states have internal predecessors, (67), 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:29,057 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-07-13 15:12:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 15:12:29,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:29,058 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, 1] [2022-07-13 15:12:29,079 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:29,271 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:29,271 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2018358036, now seen corresponding path program 1 times [2022-07-13 15:12:29,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:29,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221520630] [2022-07-13 15:12:29,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:29,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:30,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:30,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:30,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:12:30,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:30,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221520630] [2022-07-13 15:12:30,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221520630] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:30,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309442431] [2022-07-13 15:12:30,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:30,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:30,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:30,643 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:30,644 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:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:30,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 161 conjunts are in the unsatisfiable core [2022-07-13 15:12:30,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:30,882 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:31,031 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:12:31,038 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:12:31,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:31,050 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:12:31,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 15:12: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, 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:31,211 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:31,215 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:31,444 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 15:12:31,444 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 17 treesize of output 21 [2022-07-13 15:12:31,458 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:31,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 14 treesize of output 16 [2022-07-13 15:12:31,470 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:31,541 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:31,560 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:12:31,566 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:31,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2022-07-13 15:12:31,581 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:31,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:31,706 INFO L356 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2022-07-13 15:12:31,706 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 173 treesize of output 106 [2022-07-13 15:12:31,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:31,712 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 45 treesize of output 38 [2022-07-13 15:12:31,722 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-13 15:12:31,722 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 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 15:12:32,222 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-13 15:12:32,223 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 181 treesize of output 65 [2022-07-13 15:12:32,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:32,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:32,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2022-07-13 15:12:32,239 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 11 treesize of output 7 [2022-07-13 15:12:32,242 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:32,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:32,440 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-13 15:12:32,441 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 191 treesize of output 159 [2022-07-13 15:12:32,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:32,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:32,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:32,457 INFO L356 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2022-07-13 15:12:32,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 162 [2022-07-13 15:12:32,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:32,465 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 28 treesize of output 30 [2022-07-13 15:12:32,485 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-07-13 15:12:32,485 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 34 treesize of output 36 [2022-07-13 15:12:33,140 INFO L356 Elim1Store]: treesize reduction 47, result has 48.9 percent of original size [2022-07-13 15:12:33,141 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 38 treesize of output 64 [2022-07-13 15:12:33,232 INFO L356 Elim1Store]: treesize reduction 190, result has 15.9 percent of original size [2022-07-13 15:12:33,232 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 9 case distinctions, treesize of input 232 treesize of output 130 [2022-07-13 15:12:33,278 INFO L356 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2022-07-13 15:12:33,278 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 298 treesize of output 254 [2022-07-13 15:12:33,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:33,329 INFO L356 Elim1Store]: treesize reduction 116, result has 22.7 percent of original size [2022-07-13 15:12:33,329 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 5 case distinctions, treesize of input 228 treesize of output 214 [2022-07-13 15:12:33,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:33,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:33,353 INFO L356 Elim1Store]: treesize reduction 43, result has 10.4 percent of original size [2022-07-13 15:12:33,353 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 240 treesize of output 231 [2022-07-13 15:12:33,359 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 56 treesize of output 58 [2022-07-13 15:12:33,481 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:34,829 INFO L356 Elim1Store]: treesize reduction 138, result has 2.1 percent of original size [2022-07-13 15:12:34,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 418 treesize of output 127 [2022-07-13 15:12:34,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:34,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:34,841 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-07-13 15:12:34,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 73 [2022-07-13 15:12:34,955 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 28 treesize of output 20 [2022-07-13 15:12:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:12:35,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:35,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1763 Int) (v_ArrVal_1755 Int) (v_ArrVal_1759 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse0 (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|) .cse5 v_ArrVal_1755)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1759)) (.cse3 (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|) .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1758))) (let ((.cse6 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse3 .cse6) .cse7)) (.cse4 (select (select .cse0 .cse6) .cse7))) (or (let ((.cse2 (+ .cse4 4))) (and (= 0 (select (select .cse0 .cse1) .cse2)) (= (select (select .cse3 .cse1) .cse2) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (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|) .cse5 v_ArrVal_1763)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1757) .cse1) .cse4)))))))) is different from false [2022-07-13 15:12:36,229 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_1763 Int) (v_ArrVal_1755 Int) (v_ArrVal_1759 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse0 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1755)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1759)) (.cse4 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse3 .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1758))) (let ((.cse7 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse1 (select (select .cse4 .cse7) .cse8)) (.cse2 (select (select .cse6 .cse7) .cse8))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1763)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1757) .cse1) .cse2)) (not (= (select .cse3 .cse0) 0)) (let ((.cse5 (+ 4 .cse2))) (and (= (select (select .cse4 .cse1) .cse5) 0) (= (select (select .cse6 .cse1) .cse5) 0))))))))) is different from false [2022-07-13 15:12:36,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| Int) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (v_ArrVal_1774 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1763 Int) (v_ArrVal_1755 Int) (v_ArrVal_1759 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1774))) (let ((.cse7 (select .cse10 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse1 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse6 (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1772))) (store .cse11 |ULTIMATE.start_dll_append_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_1755))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1759)) (.cse4 (store (store .cse10 |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse7 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1758))) (let ((.cse8 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse4 .cse8) .cse9)) (.cse3 (select (select .cse6 .cse8) .cse9))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1773))) (store .cse0 |ULTIMATE.start_dll_append_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_1763))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1757) .cse2) .cse3)) (let ((.cse5 (+ .cse3 4))) (and (= (select (select .cse4 .cse2) .cse5) 0) (= (select (select .cse6 .cse2) .cse5) 0))) (not (= (select .cse7 .cse1) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22|) 0))))))))) is different from false [2022-07-13 15:12:36,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309442431] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:36,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:36,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2022-07-13 15:12:36,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423977777] [2022-07-13 15:12:36,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:36,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-13 15:12:36,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:36,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-13 15:12:36,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3373, Unknown=3, NotChecked=354, Total=3906 [2022-07-13 15:12:36,919 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 54 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 46 states have internal predecessors, (80), 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:43,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:43,797 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2022-07-13 15:12:43,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 15:12:43,797 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 46 states have internal predecessors, (80), 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 47 [2022-07-13 15:12:43,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:43,798 INFO L225 Difference]: With dead ends: 79 [2022-07-13 15:12:43,798 INFO L226 Difference]: Without dead ends: 77 [2022-07-13 15:12:43,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=370, Invalid=6445, Unknown=3, NotChecked=492, Total=7310 [2022-07-13 15:12:43,801 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:43,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 484 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1171 Invalid, 0 Unknown, 194 Unchecked, 0.8s Time] [2022-07-13 15:12:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-13 15:12:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-07-13 15:12:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.126984126984127) internal successors, (71), 63 states have internal predecessors, (71), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 15:12:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2022-07-13 15:12:43,812 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 47 [2022-07-13 15:12:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:43,812 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2022-07-13 15:12:43,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 46 states have internal predecessors, (80), 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:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2022-07-13 15:12:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 15:12:43,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:43,813 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, 1, 1, 1, 1] [2022-07-13 15:12:43,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-13 15:12:44,019 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:44,020 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1855355832, now seen corresponding path program 1 times [2022-07-13 15:12:44,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:44,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002913825] [2022-07-13 15:12:44,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:44,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:44,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:45,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:45,237 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:45,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:45,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002913825] [2022-07-13 15:12:45,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002913825] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:45,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364021564] [2022-07-13 15:12:45,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:45,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:45,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:45,240 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:45,268 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:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:45,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 171 conjunts are in the unsatisfiable core [2022-07-13 15:12:45,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:45,711 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:45,754 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:45,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:45,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 15:12:46,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:46,091 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 11 treesize of output 7 [2022-07-13 15:12:46,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:46,241 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-13 15:12:46,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-13 15:12:46,338 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:46,349 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:46,472 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:12:46,473 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 65 treesize of output 60 [2022-07-13 15:12:46,478 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 22 treesize of output 24 [2022-07-13 15:12:46,968 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:12:46,969 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 89 treesize of output 40 [2022-07-13 15:12:46,976 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:46,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:46,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-13 15:12:47,084 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:47,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:47,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:47,184 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:47,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:47,197 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:12:47,198 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 97 treesize of output 77 [2022-07-13 15:12:47,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:47,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:47,219 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:12:47,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 43 [2022-07-13 15:12:48,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:48,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:12:48,041 INFO L356 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2022-07-13 15:12:48,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 271 treesize of output 136 [2022-07-13 15:12:48,072 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:12:48,072 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 522 treesize of output 341 [2022-07-13 15:12:48,103 INFO L356 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2022-07-13 15:12:48,104 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 7 new quantified variables, introduced 4 case distinctions, treesize of input 473 treesize of output 304 [2022-07-13 15:12:48,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:48,115 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:12:48,142 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-13 15:12:48,142 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 194 treesize of output 166 [2022-07-13 15:12:48,147 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:12:48,461 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:12:48,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 137 [2022-07-13 15:12:48,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:12:48,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:12:48,587 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-13 15:12:48,587 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 158 treesize of output 61 [2022-07-13 15:12:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:12:48,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:12:49,927 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:12:49,927 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 639 treesize of output 632 [2022-07-13 15:12:49,956 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:12:49,957 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 10216 treesize of output 9652 [2022-07-13 15:12:49,973 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 10492 treesize of output 9092 [2022-07-13 15:12:51,168 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 283 treesize of output 3 [2022-07-13 15:12:51,229 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:12:51,230 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 1446 treesize of output 1450 [2022-07-13 15:12:53,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364021564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:53,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:12:53,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 57 [2022-07-13 15:12:53,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056200945] [2022-07-13 15:12:53,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:12:53,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-13 15:12:53,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:12:53,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-13 15:12:53,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=4333, Unknown=2, NotChecked=0, Total=4556 [2022-07-13 15:12:53,241 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 57 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 48 states have internal predecessors, (81), 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:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:12:55,593 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-07-13 15:12:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 15:12:55,594 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 48 states have internal predecessors, (81), 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 48 [2022-07-13 15:12:55,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:12:55,594 INFO L225 Difference]: With dead ends: 78 [2022-07-13 15:12:55,595 INFO L226 Difference]: Without dead ends: 73 [2022-07-13 15:12:55,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1403 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=421, Invalid=6549, Unknown=2, NotChecked=0, Total=6972 [2022-07-13 15:12:55,596 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 48 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 15:12:55,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 500 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 871 Invalid, 0 Unknown, 35 Unchecked, 0.6s Time] [2022-07-13 15:12:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-13 15:12:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-07-13 15:12:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 15:12:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-07-13 15:12:55,608 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 48 [2022-07-13 15:12:55,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:12:55,609 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-07-13 15:12:55,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 48 states have internal predecessors, (81), 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:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-07-13 15:12:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 15:12:55,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:12:55,610 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:12:55,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-13 15:12:55,819 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:55,820 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:12:55,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:12:55,820 INFO L85 PathProgramCache]: Analyzing trace with hash 638551040, now seen corresponding path program 2 times [2022-07-13 15:12:55,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:12:55,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067098170] [2022-07-13 15:12:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:12:55,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:12:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:56,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 15:12:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:56,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 15:12:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:56,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 15:12:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:12:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:12:57,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:12:57,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067098170] [2022-07-13 15:12:57,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067098170] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:12:57,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643782136] [2022-07-13 15:12:57,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:12:57,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:12:57,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:12:57,196 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:57,227 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:57,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:12:57,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:12:57,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 189 conjunts are in the unsatisfiable core [2022-07-13 15:12:57,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:12:57,457 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:57,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:12:57,631 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 15:12:57,655 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:57,847 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:57,848 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 673357 column 46: unknown constant v_old(#valid)_AFTER_CALL_21 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:57,853 INFO L158 Benchmark]: Toolchain (without parser) took 51818.76ms. Allocated memory was 94.4MB in the beginning and 249.6MB in the end (delta: 155.2MB). Free memory was 62.9MB in the beginning and 100.6MB in the end (delta: -37.7MB). Peak memory consumption was 116.6MB. Max. memory is 16.1GB. [2022-07-13 15:12:57,853 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 94.4MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:12:57,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.68ms. Allocated memory is still 94.4MB. Free memory was 62.7MB in the beginning and 62.2MB in the end (delta: 538.4kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 15:12:57,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.08ms. Allocated memory is still 94.4MB. Free memory was 62.2MB in the beginning and 59.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:12:57,854 INFO L158 Benchmark]: Boogie Preprocessor took 23.49ms. Allocated memory is still 94.4MB. Free memory was 59.9MB in the beginning and 58.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:12:57,854 INFO L158 Benchmark]: RCFGBuilder took 414.31ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 58.3MB in the beginning and 91.2MB in the end (delta: -32.9MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2022-07-13 15:12:57,855 INFO L158 Benchmark]: TraceAbstraction took 50942.74ms. Allocated memory was 117.4MB in the beginning and 249.6MB in the end (delta: 132.1MB). Free memory was 90.5MB in the beginning and 100.6MB in the end (delta: -10.1MB). Peak memory consumption was 123.0MB. Max. memory is 16.1GB. [2022-07-13 15:12:57,856 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.10ms. Allocated memory is still 94.4MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.68ms. Allocated memory is still 94.4MB. Free memory was 62.7MB in the beginning and 62.2MB in the end (delta: 538.4kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.08ms. Allocated memory is still 94.4MB. Free memory was 62.2MB in the beginning and 59.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.49ms. Allocated memory is still 94.4MB. Free memory was 59.9MB in the beginning and 58.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 414.31ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 58.3MB in the beginning and 91.2MB in the end (delta: -32.9MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * TraceAbstraction took 50942.74ms. Allocated memory was 117.4MB in the beginning and 249.6MB in the end (delta: 132.1MB). Free memory was 90.5MB in the beginning and 100.6MB in the end (delta: -10.1MB). Peak memory consumption was 123.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 673357 column 46: unknown constant v_old(#valid)_AFTER_CALL_21 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 673357 column 46: unknown constant v_old(#valid)_AFTER_CALL_21: 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:57,900 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_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:12:59,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:12:59,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:12:59,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:12:59,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:12:59,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:12:59,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:12:59,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:12:59,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:12:59,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:12:59,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:12:59,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:12:59,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:12:59,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:12:59,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:12:59,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:12:59,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:12:59,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:12:59,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:12:59,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:12:59,747 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:12:59,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:12:59,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:12:59,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:12:59,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:12:59,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:12:59,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:12:59,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:12:59,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:12:59,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:12:59,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:12:59,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:12:59,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:12:59,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:12:59,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:12:59,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:12:59,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:12:59,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:12:59,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:12:59,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:12:59,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:12:59,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:12:59,763 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:59,782 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:12:59,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:12:59,783 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:12:59,783 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:12:59,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:12:59,784 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:12:59,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:12:59,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:12:59,785 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:12:59,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:12:59,785 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:12:59,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:12:59,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:12:59,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:12:59,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:12:59,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:12:59,787 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 15:12:59,787 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 15:12:59,787 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 15:12:59,787 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:12:59,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:12:59,788 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:12:59,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:12:59,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:12:59,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:12:59,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:12:59,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:12:59,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:12:59,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:12:59,789 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:12:59,790 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 15:12:59,790 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 15:12:59,790 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:12:59,790 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:12:59,790 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:12:59,791 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 15:12:59,793 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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2022-07-13 15:13:00,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:13:00,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:13:00,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:13:00,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:13:00,166 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:13:00,168 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-07-13 15:13:00,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4d914cd/11d3ce57cba542ceadace8ecea6f7cae/FLAGbe697c201 [2022-07-13 15:13:00,745 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:13:00,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-07-13 15:13:00,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4d914cd/11d3ce57cba542ceadace8ecea6f7cae/FLAGbe697c201 [2022-07-13 15:13:01,239 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4d914cd/11d3ce57cba542ceadace8ecea6f7cae [2022-07-13 15:13:01,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:13:01,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:13:01,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:13:01,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:13:01,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:13:01,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:13:01" (1/1) ... [2022-07-13 15:13:01,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57d934bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:13:01, skipping insertion in model container [2022-07-13 15:13:01,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:13:01" (1/1) ... [2022-07-13 15:13:01,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:13:01,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:13:01,574 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_unequal.i[24457,24470] [2022-07-13 15:13:01,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:13:01,593 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:13:01,653 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_unequal.i[24457,24470] [2022-07-13 15:13:01,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:13:01,686 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:13:01,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:13:01 WrapperNode [2022-07-13 15:13:01,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:13:01,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:13:01,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:13:01,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:13:01,693 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:13:01" (1/1) ... [2022-07-13 15:13:01,713 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:13:01" (1/1) ... [2022-07-13 15:13:01,748 INFO L137 Inliner]: procedures = 130, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2022-07-13 15:13:01,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:13:01,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:13:01,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:13:01,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:13:01,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:13:01" (1/1) ... [2022-07-13 15:13:01,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:13:01" (1/1) ... [2022-07-13 15:13:01,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:13:01" (1/1) ... [2022-07-13 15:13:01,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:13:01" (1/1) ... [2022-07-13 15:13:01,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:13:01" (1/1) ... [2022-07-13 15:13:01,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:13:01" (1/1) ... [2022-07-13 15:13:01,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:13:01" (1/1) ... [2022-07-13 15:13:01,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:13:01,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:13:01,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:13:01,804 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:13:01,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:13:01" (1/1) ... [2022-07-13 15:13:01,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:13:01,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:13:01,841 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:13:01,851 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:13:01,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 15:13:01,880 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-13 15:13:01,881 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-13 15:13:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:13:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:13:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 15:13:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:13:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:13:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:13:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 15:13:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 15:13:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 15:13:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:13:01,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:13:02,047 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:13:02,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:13:02,350 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:13:02,356 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:13:02,356 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 15:13:02,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:13:02 BoogieIcfgContainer [2022-07-13 15:13:02,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:13:02,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:13:02,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:13:02,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:13:02,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:13:01" (1/3) ... [2022-07-13 15:13:02,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9be5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:13:02, skipping insertion in model container [2022-07-13 15:13:02,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:13:01" (2/3) ... [2022-07-13 15:13:02,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9be5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:13:02, skipping insertion in model container [2022-07-13 15:13:02,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:13:02" (3/3) ... [2022-07-13 15:13:02,375 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2022-07-13 15:13:02,387 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:13:02,387 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:13:02,438 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:13:02,443 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@d5eeddf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c90ed66 [2022-07-13 15:13:02,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:13:02,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 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:13:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 15:13:02,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:13:02,454 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:13:02,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:13:02,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:13:02,458 INFO L85 PathProgramCache]: Analyzing trace with hash -346371136, now seen corresponding path program 1 times [2022-07-13 15:13:02,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:13:02,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986519395] [2022-07-13 15:13:02,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:02,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:13:02,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:13:02,475 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:13:02,495 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:13:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:02,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 15:13:02,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:02,648 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:13:02,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:13:02,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:13:02,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986519395] [2022-07-13 15:13:02,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986519395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:13:02,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:13:02,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:13:02,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580228444] [2022-07-13 15:13:02,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:13:02,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:13:02,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:13:02,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:13:02,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:13:02,694 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 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:13:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:13:02,716 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2022-07-13 15:13:02,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:13:02,717 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:13:02,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:13:02,721 INFO L225 Difference]: With dead ends: 65 [2022-07-13 15:13:02,722 INFO L226 Difference]: Without dead ends: 30 [2022-07-13 15:13:02,724 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:13:02,730 INFO L413 NwaCegarLoop]: 46 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, 46 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:13:02,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:13:02,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-13 15:13:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-13 15:13:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 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:13:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-07-13 15:13:02,757 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-07-13 15:13:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:13:02,757 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-07-13 15:13:02,757 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:13:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-07-13 15:13:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 15:13:02,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:13:02,759 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:13:02,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 15:13:02,969 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:13:02,970 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:13:02,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:13:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1530291827, now seen corresponding path program 1 times [2022-07-13 15:13:02,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:13:02,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395633623] [2022-07-13 15:13:02,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:02,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:13:02,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:13:02,975 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:13:02,976 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:13:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:03,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 15:13:03,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:03,099 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:13:03,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:13:03,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:13:03,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395633623] [2022-07-13 15:13:03,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395633623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:13:03,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:13:03,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:13:03,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645404849] [2022-07-13 15:13:03,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:13:03,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:13:03,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:13:03,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:13:03,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:13:03,109 INFO L87 Difference]: Start difference. First operand 30 states and 38 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:13:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:13:03,129 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-07-13 15:13:03,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:13:03,130 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:13:03,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:13:03,135 INFO L225 Difference]: With dead ends: 58 [2022-07-13 15:13:03,136 INFO L226 Difference]: Without dead ends: 35 [2022-07-13 15:13:03,136 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:13:03,138 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 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:13:03,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:13:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-13 15:13:03,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-07-13 15:13:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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:13:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-13 15:13:03,156 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2022-07-13 15:13:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:13:03,157 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-13 15:13:03,157 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:13:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-13 15:13:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:13:03,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:13:03,159 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:13:03,177 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:13:03,378 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:13:03,378 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:13:03,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:13:03,380 INFO L85 PathProgramCache]: Analyzing trace with hash 878865159, now seen corresponding path program 1 times [2022-07-13 15:13:03,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:13:03,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303645808] [2022-07-13 15:13:03,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:03,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:13:03,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:13:03,382 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:13:03,384 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:13:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:03,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 15:13:03,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:03,582 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:13:03,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:13:03,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:13:03,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303645808] [2022-07-13 15:13:03,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303645808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:13:03,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:13:03,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:13:03,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111642927] [2022-07-13 15:13:03,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:13:03,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:13:03,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:13:03,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:13:03,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:13:03,590 INFO L87 Difference]: Start difference. First operand 31 states and 39 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:13:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:13:03,628 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2022-07-13 15:13:03,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:13:03,629 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:13:03,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:13:03,631 INFO L225 Difference]: With dead ends: 63 [2022-07-13 15:13:03,631 INFO L226 Difference]: Without dead ends: 35 [2022-07-13 15:13:03,632 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:13:03,634 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 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:13:03,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:13:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-13 15:13:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-07-13 15:13:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:13:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-07-13 15:13:03,645 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 27 [2022-07-13 15:13:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:13:03,645 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-13 15:13:03,645 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:13:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-07-13 15:13:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:13:03,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:13:03,647 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:13:03,660 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:13:03,857 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:13:03,858 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:13:03,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:13:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash -709482743, now seen corresponding path program 1 times [2022-07-13 15:13:03,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:13:03,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395698214] [2022-07-13 15:13:03,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:03,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:13:03,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:13:03,861 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:13:03,863 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:13:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:03,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:13:03,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:04,020 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:13:04,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:04,069 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:13:04,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:13:04,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395698214] [2022-07-13 15:13:04,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395698214] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:13:04,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:13:04,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-13 15:13:04,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949969543] [2022-07-13 15:13:04,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:13:04,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:13:04,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:13:04,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:13:04,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:13:04,074 INFO L87 Difference]: Start difference. First operand 34 states and 43 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:13:04,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:13:04,119 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-07-13 15:13:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:13:04,120 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:13:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:13:04,121 INFO L225 Difference]: With dead ends: 63 [2022-07-13 15:13:04,121 INFO L226 Difference]: Without dead ends: 40 [2022-07-13 15:13:04,121 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:13:04,122 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:13:04,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:13:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-13 15:13:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2022-07-13 15:13:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 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:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-07-13 15:13:04,127 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2022-07-13 15:13:04,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:13:04,127 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-07-13 15:13:04,127 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:13:04,127 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-07-13 15:13:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:13:04,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:13:04,129 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:13:04,145 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:13:04,339 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:13:04,340 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:13:04,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:13:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1607276515, now seen corresponding path program 1 times [2022-07-13 15:13:04,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:13:04,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292058026] [2022-07-13 15:13:04,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:04,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:13:04,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:13:04,342 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:13:04,344 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:13:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:04,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 15:13:04,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:04,716 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:13:04,800 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:13:04,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:04,928 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:13:04,984 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:13:05,004 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:13:05,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:05,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:13:05,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292058026] [2022-07-13 15:13:05,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292058026] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:05,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1498983085] [2022-07-13 15:13:05,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:05,131 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:13:05,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:13:05,133 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:13:05,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-07-13 15:13:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:05,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 15:13:05,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:05,838 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:13:05,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:05,916 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:13:05,996 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:13:06,000 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:13:06,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:06,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1498983085] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:06,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:13:06,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2022-07-13 15:13:06,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709961106] [2022-07-13 15:13:06,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:13:06,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 15:13:06,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:13:06,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 15:13:06,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=503, Unknown=7, NotChecked=0, Total=600 [2022-07-13 15:13:06,090 INFO L87 Difference]: Start difference. First operand 36 states and 45 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:13:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:13:06,641 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-07-13 15:13:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:13:06,642 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:13:06,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:13:06,643 INFO L225 Difference]: With dead ends: 46 [2022-07-13 15:13:06,643 INFO L226 Difference]: Without dead ends: 36 [2022-07-13 15:13:06,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=721, Unknown=9, NotChecked=0, Total=870 [2022-07-13 15:13:06,644 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:13:06,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 155 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 31 Unchecked, 0.4s Time] [2022-07-13 15:13:06,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-13 15:13:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-13 15:13:06,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:13:06,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-13 15:13:06,650 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 37 [2022-07-13 15:13:06,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:13:06,650 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-13 15:13:06,650 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:13:06,651 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-13 15:13:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 15:13:06,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:13:06,652 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:13:06,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2022-07-13 15:13:06,864 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:13:07,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:13:07,055 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:13:07,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:13:07,058 INFO L85 PathProgramCache]: Analyzing trace with hash -859241559, now seen corresponding path program 1 times [2022-07-13 15:13:07,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:13:07,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297913391] [2022-07-13 15:13:07,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:07,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:13:07,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:13:07,059 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:13:07,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 15:13:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:07,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-13 15:13:07,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:07,347 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:07,620 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:13:07,620 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:07,677 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:07,771 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:13:07,771 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 58 treesize of output 55 [2022-07-13 15:13:07,786 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 12 treesize of output 11 [2022-07-13 15:13:08,088 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-13 15:13:08,088 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 53 treesize of output 33 [2022-07-13 15:13:08,097 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:08,105 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:08,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:08,335 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:13:08,336 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 59 treesize of output 51 [2022-07-13 15:13:08,368 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:13:08,369 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 30 treesize of output 32 [2022-07-13 15:13:08,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:08,384 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:08,504 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:08,613 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-13 15:13:08,613 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:13:08,670 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:13:08,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:08,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:13:08,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297913391] [2022-07-13 15:13:08,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297913391] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:08,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1242395356] [2022-07-13 15:13:08,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:08,909 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:13:08,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:13:08,912 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:13:08,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-07-13 15:13:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:09,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-13 15:13:09,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:09,489 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:09,971 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 11 treesize of output 7 [2022-07-13 15:13:10,243 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:13:10,247 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 18 treesize of output 24 [2022-07-13 15:13:10,261 INFO L356 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-07-13 15:13:10,261 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 15 treesize of output 15 [2022-07-13 15:13:10,273 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 6 treesize of output 4 [2022-07-13 15:13:10,891 INFO L356 Elim1Store]: treesize reduction 55, result has 11.3 percent of original size [2022-07-13 15:13:10,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, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 57 [2022-07-13 15:13:10,948 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-13 15:13:10,948 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 120 treesize of output 101 [2022-07-13 15:13:10,972 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-13 15:13:10,972 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 100 treesize of output 85 [2022-07-13 15:13:10,999 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:13:10,999 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 78 treesize of output 77 [2022-07-13 15:13:11,150 INFO L356 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-07-13 15:13:11,150 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 75 treesize of output 33 [2022-07-13 15:13:11,157 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 11 [2022-07-13 15:13:11,249 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:13:11,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:11,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_541 (_ 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 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_539))) (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_541)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_542) |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:11,951 INFO L356 Elim1Store]: treesize reduction 19, result has 64.8 percent of original size [2022-07-13 15:13:11,952 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 112 treesize of output 118 [2022-07-13 15:13:11,991 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:11,991 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 145 treesize of output 148 [2022-07-13 15:13:12,001 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 116 treesize of output 114 [2022-07-13 15:13:12,473 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (not (= (select (select |c_#memory_$Pointer$.base| .cse0) v_arrayElimIndex_11) (_ bv0 32))) (let ((.cse3 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (and (or (forall ((v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (let ((.cse1 (store (let ((.cse2 (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| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) v_arrayElimIndex_11 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_539))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) v_arrayElimCell_39))))) .cse3) (or (forall ((v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32))) (not (= (select (let ((.cse4 (store (let ((.cse5 (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| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) v_arrayElimIndex_11 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_539))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) v_arrayElimCell_41)) (_ bv0 32)))) (not .cse3)))) (and (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) (not (= (bvadd (_ bv4294967292 32) v_arrayElimIndex_11) v_arrayElimCell_39)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (not (= |c_ULTIMATE.start_dll_append_~head#1.offset| v_arrayElimIndex_11)) (not (= .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|))))))) is different from false [2022-07-13 15:13:12,769 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (not (= (select (select |c_#memory_$Pointer$.base| .cse0) v_arrayElimIndex_11) (_ bv0 32))) (let ((.cse3 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))) (and (or (forall ((v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse1 (store (let ((.cse2 (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| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) v_arrayElimIndex_11 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_539))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) v_arrayElimCell_39)) (_ bv0 32)))) .cse3) (or (not .cse3) (forall ((v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32))) (not (= (select (let ((.cse4 (store (let ((.cse5 (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| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) v_arrayElimIndex_11 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_539))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) v_arrayElimCell_41)) (_ bv0 32))))))) (and (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) (not (= (bvadd (_ bv4294967292 32) v_arrayElimIndex_11) v_arrayElimCell_39)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (not (= |c_ULTIMATE.start_dll_append_~head#1.offset| v_arrayElimIndex_11)) (not (= .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|))))))) is different from false [2022-07-13 15:13:15,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1242395356] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:15,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:13:15,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 42 [2022-07-13 15:13:15,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943428626] [2022-07-13 15:13:15,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:13:15,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-13 15:13:15,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:13:15,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-13 15:13:15,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2265, Unknown=19, NotChecked=294, Total=2756 [2022-07-13 15:13:15,054 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 42 states, 40 states have (on average 1.6) internal successors, (64), 35 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-13 15:13:17,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:13:17,395 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-07-13 15:13:17,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 15:13:17,396 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.6) internal successors, (64), 35 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2022-07-13 15:13:17,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:13:17,398 INFO L225 Difference]: With dead ends: 67 [2022-07-13 15:13:17,398 INFO L226 Difference]: Without dead ends: 39 [2022-07-13 15:13:17,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=326, Invalid=3698, Unknown=20, NotChecked=378, Total=4422 [2022-07-13 15:13:17,400 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 36 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 15:13:17,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 408 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 259 Invalid, 0 Unknown, 190 Unchecked, 0.8s Time] [2022-07-13 15:13:17,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-13 15:13:17,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-07-13 15:13:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 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:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-07-13 15:13:17,406 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 40 [2022-07-13 15:13:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:13:17,406 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-07-13 15:13:17,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.6) internal successors, (64), 35 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-13 15:13:17,407 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-07-13 15:13:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-13 15:13:17,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:13:17,408 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:17,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-07-13 15:13:17,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 15:13:17,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:13:17,809 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:13:17,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:13:17,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1563025532, now seen corresponding path program 1 times [2022-07-13 15:13:17,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:13:17,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362866626] [2022-07-13 15:13:17,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:17,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:13:17,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:13:17,811 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:13:17,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 15:13:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:18,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-13 15:13:18,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:18,059 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:18,074 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,151 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:13:18,152 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 24 [2022-07-13 15:13:18,260 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:18,364 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 15:13:18,364 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:18,432 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:18,524 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:13:18,525 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 55 treesize of output 52 [2022-07-13 15:13:18,845 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:13:18,846 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:13:18,854 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:18,862 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:13:19,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:19,059 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:13:19,059 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 62 [2022-07-13 15:13:19,091 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-13 15:13:19,092 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:13:19,126 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:19,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:19,840 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:13:19,840 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:19,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:19,895 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-13 15:13:19,895 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:20,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:13:20,096 INFO L356 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-07-13 15:13:20,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, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 34 [2022-07-13 15:13:20,106 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:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:13:20,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:20,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_652))) (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| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_651) |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:20,299 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (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_654) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_652))) (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_653) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_651) |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:20,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (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_654) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_652))) (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_653) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_651) |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:20,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_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_654) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_652))) (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_653) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-13 15:13:20,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:13:20,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362866626] [2022-07-13 15:13:20,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362866626] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:20,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [401612306] [2022-07-13 15:13:20,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:20,635 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:13:20,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:13:20,636 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:13:20,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-07-13 15:13:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:21,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-13 15:13:21,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:21,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, 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:21,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 15:13:21,976 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:13:21,977 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:22,156 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:22,327 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:13:22,327 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 56 treesize of output 53 [2022-07-13 15:13:22,934 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:22,935 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:22,943 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 17 treesize of output 13 [2022-07-13 15:13:22,949 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:25,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:25,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:25,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:25,419 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 15:13:25,419 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 85 treesize of output 66 [2022-07-13 15:13:25,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:25,440 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-13 15:13:25,441 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 34 treesize of output 28 [2022-07-13 15:13:25,541 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:13:25,541 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:25,563 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:26,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:26,770 INFO L356 Elim1Store]: treesize reduction 70, result has 22.2 percent of original size [2022-07-13 15:13:26,770 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 113 treesize of output 94 [2022-07-13 15:13:26,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:26,810 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-13 15:13:26,811 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:27,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:13:27,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:27,100 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 85 treesize of output 33 [2022-07-13 15:13:27,110 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:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:13:27,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:27,263 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_770 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_769 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_767 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_769) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_767))) (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_766) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_770) |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,287 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_770 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_769 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_767 (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_769) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_767))) (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_766) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_770) |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:31,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [401612306] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:31,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:13:31,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2022-07-13 15:13:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218722501] [2022-07-13 15:13:31,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:13:31,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-13 15:13:31,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:13:31,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-13 15:13:31,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2867, Unknown=20, NotChecked=678, Total=3782 [2022-07-13 15:13:31,264 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 40 states have internal predecessors, (69), 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:39,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:13:39,181 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-07-13 15:13:39,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 15:13:39,182 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 40 states have internal predecessors, (69), 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 42 [2022-07-13 15:13:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:13:39,183 INFO L225 Difference]: With dead ends: 48 [2022-07-13 15:13:39,183 INFO L226 Difference]: Without dead ends: 45 [2022-07-13 15:13:39,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=396, Invalid=4720, Unknown=20, NotChecked=870, Total=6006 [2022-07-13 15:13:39,185 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 15:13:39,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 447 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 263 Invalid, 0 Unknown, 223 Unchecked, 0.8s Time] [2022-07-13 15:13:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-13 15:13:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-07-13 15:13:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 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:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-07-13 15:13:39,192 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 42 [2022-07-13 15:13:39,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:13:39,193 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-07-13 15:13:39,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 40 states have internal predecessors, (69), 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:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-07-13 15:13:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 15:13:39,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:13:39,194 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:39,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2022-07-13 15:13:39,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 15:13:39,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:13:39,598 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:13:39,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:13:39,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1146227584, now seen corresponding path program 1 times [2022-07-13 15:13:39,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:13:39,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966737988] [2022-07-13 15:13:39,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:39,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:13:39,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:13:39,600 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:13:39,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 15:13:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:39,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-13 15:13:39,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:39,912 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:39,949 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:40,030 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:13:40,030 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:40,162 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:40,281 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 15:13:40,281 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:40,349 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:40,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:40,362 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:40,454 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:13:40,455 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:40,461 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:40,830 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:13:40,831 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:40,841 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:40,850 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:40,856 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:41,058 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:13:41,059 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:41,063 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:41,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:41,103 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:13:41,103 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:41,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:41,110 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:41,139 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-13 15:13:41,139 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:41,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:13:41,885 INFO L356 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2022-07-13 15:13:41,885 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 179 treesize of output 91 [2022-07-13 15:13:41,940 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:13:41,940 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 210 treesize of output 133 [2022-07-13 15:13:41,952 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 54 treesize of output 48 [2022-07-13 15:13:41,971 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 43 treesize of output 47 [2022-07-13 15:13:41,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:41,987 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 28 treesize of output 30 [2022-07-13 15:13:42,122 INFO L356 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-07-13 15:13:42,123 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 120 treesize of output 40 [2022-07-13 15:13:42,129 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:42,235 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:42,282 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:42,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:42,455 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (bvadd (_ bv4 32) |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_899) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_894) (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 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_897) |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 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_895) |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:42,520 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_15| (_ BitVec 32)) (v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_899 (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|))) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_15| (_ bv4 32)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_899) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_894) (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_897) |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) .cse1 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_895) |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:42,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_15| (_ BitVec 32)) (v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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)))) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_15| (_ bv4 32)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_899) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_894) (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_897) |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) .cse1 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-13 15:13:42,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_15| (_ BitVec 32)) (v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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)))) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_15| (_ bv4 32)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_899) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_894) (select (select (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_897) |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) .cse1 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-13 15:13:43,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:13:43,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966737988] [2022-07-13 15:13:43,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966737988] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:43,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [322732401] [2022-07-13 15:13:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:13:43,025 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:13:43,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:13:43,026 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:13:43,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-07-13 15:13:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:13:43,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-13 15:13:43,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:43,631 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:44,178 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:44,475 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:13:44,475 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:44,612 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:44,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:44,622 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:44,632 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:44,813 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:13:44,814 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 69 treesize of output 64 [2022-07-13 15:13:44,819 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:44,824 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:45,535 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:45,535 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 74 treesize of output 37 [2022-07-13 15:13:45,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:45,544 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:45,548 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:45,553 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:45,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:45,808 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:13:45,808 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 80 treesize of output 68 [2022-07-13 15:13:45,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:45,819 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:45,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:45,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:45,836 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:13:45,836 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 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-13 15:13:45,860 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:13:45,861 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:46,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:46,951 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:13:46,951 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 139 treesize of output 114 [2022-07-13 15:13:46,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:47,001 INFO L356 Elim1Store]: treesize reduction 66, result has 23.3 percent of original size [2022-07-13 15:13:47,002 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 65 treesize of output 71 [2022-07-13 15:13:47,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:47,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:47,013 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:47,355 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:47,355 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 77 treesize of output 36 [2022-07-13 15:13:47,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:13:47,366 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 1 case distinctions, treesize of input 22 treesize of output 10 [2022-07-13 15:13:47,475 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:47,487 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:47,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:47,504 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1028 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1025 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1027) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1030) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1031) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1028) |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_1025) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-13 15:13:47,529 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1028 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1025 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1029 (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_1027) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1030) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1031) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1028) |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_1025) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1029) |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:47,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1028 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1025 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_1027) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1030) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1031) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1028) |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_1025) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-13 15:13:47,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1028 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1025 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1029 (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_1027) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1030) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1031) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1028) |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_1025) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1029) |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:48,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [322732401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:48,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:13:48,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 49 [2022-07-13 15:13:48,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589390558] [2022-07-13 15:13:48,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:13:48,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-13 15:13:48,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:13:48,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-13 15:13:48,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2676, Unknown=17, NotChecked=888, Total=3782 [2022-07-13 15:13:48,195 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 49 states, 47 states have (on average 1.425531914893617) internal successors, (67), 38 states have internal predecessors, (67), 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:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:13:52,740 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-07-13 15:13:52,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 15:13:52,741 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.425531914893617) internal successors, (67), 38 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2022-07-13 15:13:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:13:52,742 INFO L225 Difference]: With dead ends: 55 [2022-07-13 15:13:52,742 INFO L226 Difference]: Without dead ends: 53 [2022-07-13 15:13:52,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=377, Invalid=4608, Unknown=17, NotChecked=1160, Total=6162 [2022-07-13 15:13:52,744 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:13:52,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 495 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 493 Invalid, 0 Unknown, 217 Unchecked, 1.3s Time] [2022-07-13 15:13:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-13 15:13:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2022-07-13 15:13:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 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:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-07-13 15:13:52,757 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 44 [2022-07-13 15:13:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:13:52,758 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-07-13 15:13:52,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.425531914893617) internal successors, (67), 38 states have internal predecessors, (67), 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:52,758 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-07-13 15:13:52,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 15:13:52,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:13:52,761 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:52,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-07-13 15:13:52,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-13 15:13:53,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:13:53,167 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:13:53,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:13:53,167 INFO L85 PathProgramCache]: Analyzing trace with hash 705409183, now seen corresponding path program 2 times [2022-07-13 15:13:53,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:13:53,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153345358] [2022-07-13 15:13:53,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:13:53,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:13:53,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:13:53,169 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:13:53,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-13 15:13:53,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:13:53,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:13:53,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-13 15:13:53,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:53,516 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:53,582 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:13:53,587 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:13:53,832 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:13:53,833 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:53,844 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:13:53,859 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:13:53,922 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:13:53,927 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:13:53,954 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:13:53,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, 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:13:54,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:54,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:13:54,053 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:13:54,053 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:13:54,064 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:13:54,444 INFO L356 Elim1Store]: treesize reduction 11, result has 66.7 percent of original size [2022-07-13 15:13:54,445 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:13:54,455 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:54,467 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-13 15:13:54,468 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:13:54,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:54,702 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-13 15:13:54,702 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:13:54,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:54,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:54,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:54,725 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-13 15:13:54,725 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:13:54,753 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:13:54,753 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:55,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:13:55,143 INFO L356 Elim1Store]: treesize reduction 88, result has 24.1 percent of original size [2022-07-13 15:13:55,144 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:13:55,182 INFO L356 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2022-07-13 15:13:55,182 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:13:55,217 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:13:55,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:13:55,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:13:55,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153345358] [2022-07-13 15:13:55,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153345358] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:13:55,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [239230728] [2022-07-13 15:13:55,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:13:55,585 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:13:55,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:13:55,586 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:13:55,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-07-13 15:13:55,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:13:55,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:13:55,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-13 15:13:55,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:13:56,060 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:56,670 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 19 treesize of output 11 [2022-07-13 15:13:56,675 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:56,680 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:56,969 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:13:56,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, 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:56,976 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:56,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:56,996 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 25 treesize of output 25 [2022-07-13 15:13:57,015 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:13:57,015 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 17 treesize of output 17 [2022-07-13 15:13:58,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:58,635 INFO L356 Elim1Store]: treesize reduction 159, result has 28.4 percent of original size [2022-07-13 15:13:58,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 231 treesize of output 145 [2022-07-13 15:13:58,760 INFO L356 Elim1Store]: treesize reduction 88, result has 29.6 percent of original size [2022-07-13 15:13:58,760 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 208 treesize of output 208 [2022-07-13 15:13:58,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:58,834 INFO L356 Elim1Store]: treesize reduction 100, result has 16.0 percent of original size [2022-07-13 15:13:58,835 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 209 treesize of output 179 [2022-07-13 15:13:58,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:58,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:13:58,860 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 43 treesize of output 48 [2022-07-13 15:14:00,519 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 40 treesize of output 28 [2022-07-13 15:14:00,546 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:14:00,686 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 50 treesize of output 34 [2022-07-13 15:14:00,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 28 treesize of output 20 [2022-07-13 15:14:00,813 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 26 treesize of output 18 [2022-07-13 15:14:00,894 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:14:02,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:14:02,337 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 54 treesize of output 30 [2022-07-13 15:14:02,406 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 43 treesize of output 27 [2022-07-13 15:14:12,599 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 49 treesize of output 33 [2022-07-13 15:14:15,880 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 49 treesize of output 33 [2022-07-13 15:14:19,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:14:20,100 INFO L356 Elim1Store]: treesize reduction 172, result has 66.1 percent of original size [2022-07-13 15:14:20,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 461 treesize of output 468 [2022-07-13 15:14:20,128 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-13 15:14:20,128 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 475 treesize of output 445 [2022-07-13 15:14:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:14:38,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:14:38,918 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1266 (Array (_ BitVec 32) (_ BitVec 32)))) (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 v_ArrVal_1267)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1266)) (.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_1262))) (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|)))) (or (not (= (select (select .cse0 .cse1) .cse2) (_ bv0 32))) (not (= (select (select .cse3 .cse1) .cse2) (_ bv0 32)))))))) is different from false [2022-07-13 15:14:41,899 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1266 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_26| (_ BitVec 32)) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (let ((.cse7 (select (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|)))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse7)) (.cse3 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_26| (_ bv4 32)))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse7 (store .cse3 .cse4 v_ArrVal_1267)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1266)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse7 (store .cse5 .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1262))) (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 .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (not (= (select (select .cse0 .cse1) .cse2) (_ bv0 32))) (not (= (select .cse3 .cse4) (_ bv0 32))) (not (= (select .cse5 .cse4) (_ bv0 32))) (not (= (select (select .cse6 .cse1) .cse2) (_ bv0 32))))))))) is different from false [2022-07-13 15:14:55,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [239230728] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:14:55,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:14:55,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2022-07-13 15:14:55,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211341338] [2022-07-13 15:14:55,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:14:55,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-13 15:14:55,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:14:55,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-13 15:14:55,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3065, Unknown=27, NotChecked=226, Total=3540 [2022-07-13 15:14:55,691 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 46 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 40 states have internal predecessors, (72), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-13 15:14:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:14:59,984 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2022-07-13 15:14:59,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-13 15:14:59,985 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 40 states have internal predecessors, (72), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-07-13 15:14:59,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:14:59,986 INFO L225 Difference]: With dead ends: 80 [2022-07-13 15:14:59,986 INFO L226 Difference]: Without dead ends: 67 [2022-07-13 15:14:59,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1673 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=383, Invalid=5297, Unknown=28, NotChecked=298, Total=6006 [2022-07-13 15:14:59,988 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:14:59,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 490 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 312 Invalid, 0 Unknown, 331 Unchecked, 1.0s Time] [2022-07-13 15:14:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-13 15:14:59,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-07-13 15:14:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 58 states have internal predecessors, (68), 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:14:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-07-13 15:15:00,000 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 44 [2022-07-13 15:15:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:15:00,000 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-07-13 15:15:00,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 40 states have internal predecessors, (72), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-13 15:15:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-07-13 15:15:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 15:15:00,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:15:00,001 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, 1] [2022-07-13 15:15:00,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2022-07-13 15:15:00,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-13 15:15:00,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:15:00,407 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:15:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:15:00,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1173262244, now seen corresponding path program 1 times [2022-07-13 15:15:00,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:15:00,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525125758] [2022-07-13 15:15:00,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:15:00,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:15:00,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:15:00,409 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:15:00,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-13 15:15:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:00,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 15:15:00,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:15:00,616 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 31 treesize of output 19 [2022-07-13 15:15:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-13 15:15:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 15:15:00,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:15:00,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:15:00,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525125758] [2022-07-13 15:15:00,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525125758] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:15:00,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:15:00,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:15:00,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998826673] [2022-07-13 15:15:00,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:15:00,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:15:00,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:15:00,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:15:00,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:15:00,630 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 15:15:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:15:00,788 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2022-07-13 15:15:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:15:00,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-13 15:15:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:15:00,789 INFO L225 Difference]: With dead ends: 75 [2022-07-13 15:15:00,789 INFO L226 Difference]: Without dead ends: 70 [2022-07-13 15:15:00,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:15:00,790 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:15:00,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 108 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:15:00,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-13 15:15:00,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-07-13 15:15:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 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:15:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-07-13 15:15:00,807 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 45 [2022-07-13 15:15:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:15:00,807 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-07-13 15:15:00,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 15:15:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-07-13 15:15:00,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 15:15:00,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:15:00,808 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, 1] [2022-07-13 15:15:00,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-13 15:15:01,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:15:01,015 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:15:01,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:15:01,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2018358036, now seen corresponding path program 1 times [2022-07-13 15:15:01,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:15:01,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172895179] [2022-07-13 15:15:01,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:15:01,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:15:01,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:15:01,017 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:15:01,018 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:15:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:01,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 98 conjunts are in the unsatisfiable core [2022-07-13 15:15:01,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:15:01,352 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,375 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:01,448 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:15:01,449 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:01,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:01,498 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:15:01,606 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:15:01,610 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:01,761 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:15:01,761 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:15:01,769 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:01,835 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 15:15:01,835 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:01,969 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:01,991 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:15:02,003 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:02,135 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:15:02,136 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:15:02,142 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:02,149 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:15:02,565 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:15:02,565 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:15:02,572 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:02,578 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:15:02,584 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:15:02,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:02,807 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:15:02,807 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:15:02,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:02,817 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:02,851 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-13 15:15:02,851 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:15:02,859 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:03,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:15:03,751 INFO L356 Elim1Store]: treesize reduction 127, result has 15.9 percent of original size [2022-07-13 15:15:03,751 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 127 [2022-07-13 15:15:03,810 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:15:03,811 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 401 treesize of output 274 [2022-07-13 15:15:03,865 INFO L356 Elim1Store]: treesize reduction 102, result has 16.4 percent of original size [2022-07-13 15:15:03,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 4 new quantified variables, introduced 3 case distinctions, treesize of input 360 treesize of output 301 [2022-07-13 15:15:03,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:03,877 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 114 treesize of output 102 [2022-07-13 15:15:03,884 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 62 treesize of output 64 [2022-07-13 15:15:04,401 INFO L356 Elim1Store]: treesize reduction 45, result has 8.2 percent of original size [2022-07-13 15:15:04,401 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 224 treesize of output 75 [2022-07-13 15:15:04,418 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:15:04,418 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:15:04,534 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:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:15:04,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:15:04,894 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1490 (_ BitVec 32)) (v_ArrVal_1488 (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_1492) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1488)) (.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_1489))) (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_1490)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1494) (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:04,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1490 (_ BitVec 32)) (v_ArrVal_1488 (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_1492) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1488)) (.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_1489))) (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_1490)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1494) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2022-07-13 15:15:05,042 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1490 (_ BitVec 32)) (v_ArrVal_1488 (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_1492) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1488)) (.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_1489))) (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_1490)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1494) (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:05,084 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1490 (_ BitVec 32)) (v_ArrVal_1488 (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_1492) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1488)) (.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_1489))) (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_1490)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1494) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2022-07-13 15:15:06,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:15:06,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172895179] [2022-07-13 15:15:06,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172895179] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:15:06,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1888839104] [2022-07-13 15:15:06,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:15:06,345 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:15:06,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:15:06,349 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:15:06,350 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:15:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:06,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-13 15:15:06,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:15:07,083 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:07,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:07,462 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:15:07,763 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:15:07,766 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:08,186 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:15:08,187 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:08,219 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:15:08,393 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:08,404 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:08,414 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:15:08,640 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:15:08,641 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:15:08,647 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:08,659 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:15:09,488 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:15:09,489 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:15:09,494 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:15:09,499 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:09,507 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:15:09,507 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:09,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:09,808 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:15:09,808 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:15:09,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:09,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, 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:15:09,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:09,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:09,835 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:15:09,836 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 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-13 15:15:09,878 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:15:09,878 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:15:11,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:11,112 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:15:11,112 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:15:11,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:11,166 INFO L356 Elim1Store]: treesize reduction 66, result has 23.3 percent of original size [2022-07-13 15:15:11,166 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:15:11,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:15:11,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:11,176 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:15:11,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, 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:11,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:15:11,958 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:15:11,958 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:15:11,984 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-13 15:15:11,984 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:15:12,192 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:15:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:15:12,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:15:12,251 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1623 (_ BitVec 32)) (v_ArrVal_1630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1624 (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_1627) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1629)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1624) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1626))) (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_1623)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1630) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2022-07-13 15:15:12,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1623 (_ BitVec 32)) (v_ArrVal_1630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_1627) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1629)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1624) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1626))) (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_1623)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1630) (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:12,367 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1623 (_ BitVec 32)) (v_ArrVal_1630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1624 (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_1627) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1629)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1624) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1626))) (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_1623)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1630) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))) is different from false [2022-07-13 15:15:12,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1623 (_ BitVec 32)) (v_ArrVal_1630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1624 (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_1627) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1629)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1624) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1626))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) v_ArrVal_1623)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1630) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))) is different from false [2022-07-13 15:15:14,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1888839104] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:15:14,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:15:14,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 53 [2022-07-13 15:15:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733626887] [2022-07-13 15:15:14,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:15:14,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-13 15:15:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:15:14,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-13 15:15:14,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3225, Unknown=14, NotChecked=968, Total=4422 [2022-07-13 15:15:14,353 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 53 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 41 states have internal predecessors, (76), 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:15:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:15:20,243 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2022-07-13 15:15:20,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 15:15:20,244 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 41 states have internal predecessors, (76), 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 47 [2022-07-13 15:15:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:15:20,244 INFO L225 Difference]: With dead ends: 74 [2022-07-13 15:15:20,244 INFO L226 Difference]: Without dead ends: 72 [2022-07-13 15:15:20,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=388, Invalid=5330, Unknown=14, NotChecked=1240, Total=6972 [2022-07-13 15:15:20,246 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 50 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:15:20,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 396 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 417 Invalid, 0 Unknown, 198 Unchecked, 1.3s Time] [2022-07-13 15:15:20,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-13 15:15:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-07-13 15:15:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 63 states have internal predecessors, (73), 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:15:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-07-13 15:15:20,257 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 47 [2022-07-13 15:15:20,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:15:20,258 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-07-13 15:15:20,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 41 states have internal predecessors, (76), 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:15:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-07-13 15:15:20,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 15:15:20,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:15:20,260 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, 1, 1, 1, 1] [2022-07-13 15:15:20,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-13 15:15:20,475 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:15:20,660 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:15:20,660 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:15:20,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:15:20,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1855355832, now seen corresponding path program 1 times [2022-07-13 15:15:20,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:15:20,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229192124] [2022-07-13 15:15:20,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:15:20,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:15:20,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:15:20,663 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:15:20,665 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:15:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:21,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-13 15:15:21,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:15:21,025 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:21,039 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:21,112 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:15:21,112 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:21,215 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:21,276 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 15:15:21,277 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:21,349 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:21,373 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:21,446 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:15:21,447 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:21,452 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:21,756 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:15:21,756 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:21,763 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:21,768 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:21,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:21,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:21,951 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:21,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:21,966 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:15:21,966 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:15:22,000 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-13 15:15:22,001 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:15:22,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:15:22,784 INFO L356 Elim1Store]: treesize reduction 133, result has 11.9 percent of original size [2022-07-13 15:15:22,785 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:15:22,852 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:15:22,852 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:15:22,865 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:15:22,866 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:15:22,936 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-13 15:15:22,937 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 162 treesize of output 140 [2022-07-13 15:15:23,370 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:15:23,370 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 168 treesize of output 114 [2022-07-13 15:15:23,500 INFO L356 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-07-13 15:15:23,501 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:15:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:15:23,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:15:23,860 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1753 (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_1750)) (.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_1753))) (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:15:23,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1753 (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_1750)) (.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_1753))) (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:15:23,988 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1753 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 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 ((.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_1750)) (.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_1753))) (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)))))))))) is different from false [2022-07-13 15:15:24,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1753 (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_1750)) (.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_1753))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (bvadd (_ bv4 32) (select (select .cse3 .cse1) .cse2))))))) (_ bv0 32)))) is different from false [2022-07-13 15:15:25,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:15:25,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229192124] [2022-07-13 15:15:25,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229192124] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:15:25,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [940563985] [2022-07-13 15:15:25,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:15:25,224 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:15:25,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:15:25,225 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:15:25,226 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:15:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:25,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-13 15:15:25,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:15:26,085 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:26,625 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:26,931 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:15:26,931 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:27,073 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:27,084 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:27,250 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:15:27,251 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:27,256 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:27,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:15:27,973 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:27,984 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:15:27,984 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:27,989 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:28,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:28,232 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:15:28,233 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:28,261 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:15:28,261 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:28,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:28,277 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:15:28,278 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 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-13 15:15:29,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:29,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:15:29,295 INFO L356 Elim1Store]: treesize reduction 103, result has 14.9 percent of original size [2022-07-13 15:15:29,295 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 83 [2022-07-13 15:15:29,339 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:15:29,339 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 257 treesize of output 182 [2022-07-13 15:15:29,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:29,387 INFO L356 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2022-07-13 15:15:29,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, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 203 treesize of output 173 [2022-07-13 15:15:30,017 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-07-13 15:15:30,017 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 192 treesize of output 114 [2022-07-13 15:15:30,305 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:15:30,306 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 102 treesize of output 32 [2022-07-13 15:15:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:15:30,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:15:30,419 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1873 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1873) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1869)) (.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|) (bvadd (_ bv4 32) |c_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_1874))) (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)))))))) is different from false [2022-07-13 15:15:30,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1873 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse5 (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|) .cse5))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1873) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1869)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1874))) (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:15:30,499 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1873 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (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| .cse5) .cse6))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1873) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1869)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1874))) (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:15:30,526 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1873 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (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| .cse5) .cse6))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1873) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1869)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1874))) (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:15:35,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [940563985] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:15:35,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:15:35,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 50 [2022-07-13 15:15:35,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665877282] [2022-07-13 15:15:35,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:15:35,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 15:15:35,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:15:35,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 15:15:35,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2887, Unknown=24, NotChecked=920, Total=4032 [2022-07-13 15:15:35,451 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 50 states, 48 states have (on average 1.5) internal successors, (72), 39 states have internal predecessors, (72), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 15:15:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:15:40,342 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2022-07-13 15:15:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 15:15:40,342 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.5) internal successors, (72), 39 states have internal predecessors, (72), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2022-07-13 15:15:40,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:15:40,343 INFO L225 Difference]: With dead ends: 76 [2022-07-13 15:15:40,343 INFO L226 Difference]: Without dead ends: 71 [2022-07-13 15:15:40,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=369, Invalid=5039, Unknown=26, NotChecked=1208, Total=6642 [2022-07-13 15:15:40,345 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:15:40,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 574 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 329 Invalid, 0 Unknown, 233 Unchecked, 1.0s Time] [2022-07-13 15:15:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-13 15:15:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-07-13 15:15:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 63 states have internal predecessors, (72), 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:15:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2022-07-13 15:15:40,355 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 48 [2022-07-13 15:15:40,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:15:40,355 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2022-07-13 15:15:40,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.5) internal successors, (72), 39 states have internal predecessors, (72), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 15:15:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-07-13 15:15:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 15:15:40,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:15:40,356 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:15:40,361 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:15:40,567 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:15:40,757 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:15:40,757 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:15:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:15:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash 638551040, now seen corresponding path program 2 times [2022-07-13 15:15:40,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:15:40,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155108836] [2022-07-13 15:15:40,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:15:40,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:15:40,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:15:40,759 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:15:40,760 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:15:41,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:15:41,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:15:41,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-13 15:15:41,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:15:41,153 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:41,167 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:41,248 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:15:41,248 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:41,352 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:41,460 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 15:15:41,461 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:15:41,528 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:15:41,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, 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:41,630 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:15:41,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, 2 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:41,635 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 22 treesize of output 24 [2022-07-13 15:15:41,977 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:15:41,978 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 39 [2022-07-13 15:15:41,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 15:15:41,988 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:15:46,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:46,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:46,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2022-07-13 15:15:46,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:46,227 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-13 15:15:46,227 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 97 treesize of output 74 [2022-07-13 15:15:46,257 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-13 15:15:46,258 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:15:47,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:47,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:47,408 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:15:47,590 INFO L356 Elim1Store]: treesize reduction 241, result has 14.8 percent of original size [2022-07-13 15:15:47,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 348 treesize of output 164 [2022-07-13 15:15:47,685 INFO L356 Elim1Store]: treesize reduction 276, result has 11.5 percent of original size [2022-07-13 15:15:47,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 423 treesize of output 188 [2022-07-13 15:15:48,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:15:48,873 INFO L356 Elim1Store]: treesize reduction 167, result has 6.2 percent of original size [2022-07-13 15:15:48,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 499 treesize of output 166 [2022-07-13 15:15:48,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:48,895 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-13 15:15:48,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 37 [2022-07-13 15:15:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:15:48,959 INFO L328 TraceCheckSpWp]: Computing backward predicates...