./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 12:10:48,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 12:10:48,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 12:10:48,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 12:10:48,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 12:10:48,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 12:10:48,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 12:10:48,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 12:10:48,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 12:10:48,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 12:10:48,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 12:10:48,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 12:10:48,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 12:10:48,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 12:10:48,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 12:10:48,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 12:10:48,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 12:10:48,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 12:10:48,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 12:10:48,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 12:10:48,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 12:10:48,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 12:10:48,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 12:10:48,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 12:10:48,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 12:10:48,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 12:10:48,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 12:10:48,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 12:10:48,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 12:10:48,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 12:10:48,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 12:10:48,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 12:10:48,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 12:10:48,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 12:10:48,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 12:10:48,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 12:10:48,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 12:10:48,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 12:10:48,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 12:10:48,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 12:10:48,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 12:10:48,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 12:10:48,354 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 12:10:48,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 12:10:48,355 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 12:10:48,355 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 12:10:48,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 12:10:48,356 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 12:10:48,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 12:10:48,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 12:10:48,357 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 12:10:48,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 12:10:48,358 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 12:10:48,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 12:10:48,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 12:10:48,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 12:10:48,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 12:10:48,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 12:10:48,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 12:10:48,359 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 12:10:48,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 12:10:48,360 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 12:10:48,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 12:10:48,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 12:10:48,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 12:10:48,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 12:10:48,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:10:48,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 12:10:48,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 12:10:48,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 12:10:48,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 12:10:48,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 12:10:48,362 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 12:10:48,362 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 12:10:48,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 12:10:48,363 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 12:10:48,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2021-12-21 12:10:48,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 12:10:48,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 12:10:48,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 12:10:48,678 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 12:10:48,679 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 12:10:48,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2021-12-21 12:10:48,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0fb3108/4a466bfeeb6e489293ca894933d1352e/FLAG25e5502aa [2021-12-21 12:10:49,272 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 12:10:49,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2021-12-21 12:10:49,286 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0fb3108/4a466bfeeb6e489293ca894933d1352e/FLAG25e5502aa [2021-12-21 12:10:49,708 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0fb3108/4a466bfeeb6e489293ca894933d1352e [2021-12-21 12:10:49,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 12:10:49,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 12:10:49,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 12:10:49,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 12:10:49,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 12:10:49,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:10:49" (1/1) ... [2021-12-21 12:10:49,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b48c2fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:49, skipping insertion in model container [2021-12-21 12:10:49,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:10:49" (1/1) ... [2021-12-21 12:10:49,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 12:10:49,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 12:10:50,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2021-12-21 12:10:50,017 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:10:50,028 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 12:10:50,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2021-12-21 12:10:50,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:10:50,121 INFO L208 MainTranslator]: Completed translation [2021-12-21 12:10:50,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:50 WrapperNode [2021-12-21 12:10:50,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 12:10:50,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 12:10:50,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 12:10:50,124 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 12:10:50,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:50" (1/1) ... [2021-12-21 12:10:50,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:50" (1/1) ... [2021-12-21 12:10:50,175 INFO L137 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2021-12-21 12:10:50,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 12:10:50,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 12:10:50,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 12:10:50,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 12:10:50,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:50" (1/1) ... [2021-12-21 12:10:50,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:50" (1/1) ... [2021-12-21 12:10:50,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:50" (1/1) ... [2021-12-21 12:10:50,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:50" (1/1) ... [2021-12-21 12:10:50,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:50" (1/1) ... [2021-12-21 12:10:50,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:50" (1/1) ... [2021-12-21 12:10:50,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:50" (1/1) ... [2021-12-21 12:10:50,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 12:10:50,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 12:10:50,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 12:10:50,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 12:10:50,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:50" (1/1) ... [2021-12-21 12:10:50,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:10:50,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:10:50,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 12:10:50,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 12:10:50,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 12:10:50,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 12:10:50,278 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-21 12:10:50,278 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-21 12:10:50,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 12:10:50,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 12:10:50,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 12:10:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 12:10:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 12:10:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 12:10:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 12:10:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 12:10:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 12:10:50,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 12:10:50,427 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 12:10:50,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 12:10:50,678 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 12:10:50,683 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 12:10:50,684 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-21 12:10:50,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:10:50 BoogieIcfgContainer [2021-12-21 12:10:50,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 12:10:50,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 12:10:50,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 12:10:50,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 12:10:50,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 12:10:49" (1/3) ... [2021-12-21 12:10:50,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0716e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:10:50, skipping insertion in model container [2021-12-21 12:10:50,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:50" (2/3) ... [2021-12-21 12:10:50,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0716e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:10:50, skipping insertion in model container [2021-12-21 12:10:50,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:10:50" (3/3) ... [2021-12-21 12:10:50,698 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2021-12-21 12:10:50,704 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 12:10:50,704 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 12:10:50,759 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 12:10:50,769 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 12:10:50,770 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 12:10:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:10:50,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-21 12:10:50,801 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:50,802 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:50,803 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:50,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash 308507763, now seen corresponding path program 1 times [2021-12-21 12:10:50,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:10:50,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170875233] [2021-12-21 12:10:50,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:50,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:10:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:51,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-21 12:10:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:10:51,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:10:51,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170875233] [2021-12-21 12:10:51,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170875233] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:10:51,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:10:51,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 12:10:51,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807549185] [2021-12-21 12:10:51,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:10:51,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 12:10:51,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:10:51,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 12:10:51,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:10:51,131 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 12:10:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:51,233 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2021-12-21 12:10:51,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 12:10:51,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-21 12:10:51,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:51,241 INFO L225 Difference]: With dead ends: 57 [2021-12-21 12:10:51,244 INFO L226 Difference]: Without dead ends: 26 [2021-12-21 12:10:51,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:10:51,251 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:51,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 12:10:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-21 12:10:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-21 12:10:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:10:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-12-21 12:10:51,290 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2021-12-21 12:10:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:51,290 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-21 12:10:51,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 12:10:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2021-12-21 12:10:51,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-21 12:10:51,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:51,295 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:51,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 12:10:51,296 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:51,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:51,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2109805219, now seen corresponding path program 1 times [2021-12-21 12:10:51,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:10:51,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151880989] [2021-12-21 12:10:51,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:51,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:10:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:51,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-21 12:10:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:10:51,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:10:51,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151880989] [2021-12-21 12:10:51,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151880989] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:10:51,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:10:51,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 12:10:51,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120714405] [2021-12-21 12:10:51,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:10:51,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:10:51,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:10:51,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:10:51,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:10:51,462 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 12:10:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:51,529 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2021-12-21 12:10:51,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 12:10:51,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-21 12:10:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:51,531 INFO L225 Difference]: With dead ends: 50 [2021-12-21 12:10:51,532 INFO L226 Difference]: Without dead ends: 31 [2021-12-21 12:10:51,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:10:51,540 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:51,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 70 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 12:10:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-21 12:10:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2021-12-21 12:10:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:10:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-12-21 12:10:51,554 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2021-12-21 12:10:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:51,555 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-12-21 12:10:51,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 12:10:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2021-12-21 12:10:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-21 12:10:51,561 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:51,561 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:51,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 12:10:51,562 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:51,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash 493100305, now seen corresponding path program 1 times [2021-12-21 12:10:51,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:10:51,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907356229] [2021-12-21 12:10:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:51,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:10:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:51,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 12:10:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:51,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 12:10:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 12:10:51,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:10:51,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907356229] [2021-12-21 12:10:51,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907356229] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:10:51,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:10:51,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 12:10:51,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270807755] [2021-12-21 12:10:51,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:10:51,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:10:51,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:10:51,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:10:51,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:10:51,673 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:10:51,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:51,714 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2021-12-21 12:10:51,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 12:10:51,715 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 [2021-12-21 12:10:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:51,716 INFO L225 Difference]: With dead ends: 55 [2021-12-21 12:10:51,716 INFO L226 Difference]: Without dead ends: 31 [2021-12-21 12:10:51,716 INFO L932 BasicCegarLoop]: 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 [2021-12-21 12:10:51,717 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:51,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:10:51,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-21 12:10:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-12-21 12:10:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:10:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-12-21 12:10:51,742 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2021-12-21 12:10:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:51,742 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-21 12:10:51,743 INFO L471 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) [2021-12-21 12:10:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2021-12-21 12:10:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-21 12:10:51,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:51,744 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:51,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 12:10:51,744 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:51,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247597, now seen corresponding path program 1 times [2021-12-21 12:10:51,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:10:51,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493183843] [2021-12-21 12:10:51,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:51,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:10:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:51,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 12:10:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:51,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 12:10:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 12:10:51,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:10:51,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493183843] [2021-12-21 12:10:51,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493183843] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:10:51,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132472733] [2021-12-21 12:10:51,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:51,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:10:51,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:10:51,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:10:51,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 12:10:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:51,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 12:10:51,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:10:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:10:52,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:10:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 12:10:52,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132472733] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:10:52,196 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 12:10:52,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2021-12-21 12:10:52,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951910592] [2021-12-21 12:10:52,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 12:10:52,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 12:10:52,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:10:52,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 12:10:52,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-21 12:10:52,198 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-21 12:10:52,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:52,248 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2021-12-21 12:10:52,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 12:10:52,249 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 [2021-12-21 12:10:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:52,250 INFO L225 Difference]: With dead ends: 51 [2021-12-21 12:10:52,250 INFO L226 Difference]: Without dead ends: 32 [2021-12-21 12:10:52,250 INFO L932 BasicCegarLoop]: 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 [2021-12-21 12:10:52,257 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:52,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:10:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-21 12:10:52,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-21 12:10:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:10:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2021-12-21 12:10:52,273 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2021-12-21 12:10:52,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:52,274 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-12-21 12:10:52,274 INFO L471 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) [2021-12-21 12:10:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2021-12-21 12:10:52,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 12:10:52,277 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:52,277 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:52,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 12:10:52,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:10:52,504 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:52,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash -292922041, now seen corresponding path program 1 times [2021-12-21 12:10:52,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:10:52,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713086243] [2021-12-21 12:10:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:52,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:10:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:52,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 12:10:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:52,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 12:10:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:52,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 12:10:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-21 12:10:52,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:10:52,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713086243] [2021-12-21 12:10:52,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713086243] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:10:52,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:10:52,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 12:10:52,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128028608] [2021-12-21 12:10:52,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:10:52,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 12:10:52,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:10:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 12:10:52,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-21 12:10:52,725 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:10:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:52,848 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-12-21 12:10:52,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 12:10:52,849 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-12-21 12:10:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:52,851 INFO L225 Difference]: With dead ends: 45 [2021-12-21 12:10:52,851 INFO L226 Difference]: Without dead ends: 42 [2021-12-21 12:10:52,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-12-21 12:10:52,853 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 61 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:52,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 132 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 12:10:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-21 12:10:52,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2021-12-21 12:10:52,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:10:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-12-21 12:10:52,867 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 37 [2021-12-21 12:10:52,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:52,868 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-12-21 12:10:52,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:10:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2021-12-21 12:10:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 12:10:52,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:52,872 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:52,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 12:10:52,873 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:52,874 INFO L85 PathProgramCache]: Analyzing trace with hash -292920367, now seen corresponding path program 1 times [2021-12-21 12:10:52,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:10:52,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013803622] [2021-12-21 12:10:52,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:52,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:10:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:53,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 12:10:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:53,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 12:10:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:53,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 12:10:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 12:10:53,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:10:53,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013803622] [2021-12-21 12:10:53,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013803622] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:10:53,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214556642] [2021-12-21 12:10:53,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:53,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:10:53,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:10:53,168 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:10:53,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 12:10:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:53,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-21 12:10:53,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:10:53,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-21 12:10:53,759 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_652 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_652))))) is different from true [2021-12-21 12:10:53,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:53,839 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-21 12:10:53,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-21 12:10:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-12-21 12:10:53,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:10:53,972 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int)) (|v_node_create_~temp~0#1.base_13| Int)) (or (not (< |v_node_create_~temp~0#1.base_13| |c_#StackHeapBarrier|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_13| v_ArrVal_655) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0)))) is different from false [2021-12-21 12:10:53,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214556642] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:10:53,974 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:10:53,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2021-12-21 12:10:53,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864564634] [2021-12-21 12:10:53,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:10:53,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-21 12:10:53,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:10:53,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-21 12:10:53,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=525, Unknown=2, NotChecked=94, Total=702 [2021-12-21 12:10:53,976 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 12:10:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:54,302 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2021-12-21 12:10:54,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 12:10:54,303 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 [2021-12-21 12:10:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:54,304 INFO L225 Difference]: With dead ends: 39 [2021-12-21 12:10:54,304 INFO L226 Difference]: Without dead ends: 32 [2021-12-21 12:10:54,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=856, Unknown=2, NotChecked=122, Total=1122 [2021-12-21 12:10:54,305 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:54,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 214 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 261 Invalid, 0 Unknown, 30 Unchecked, 0.2s Time] [2021-12-21 12:10:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-21 12:10:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-21 12:10:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:10:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2021-12-21 12:10:54,311 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2021-12-21 12:10:54,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:54,311 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-21 12:10:54,312 INFO L471 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) [2021-12-21 12:10:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-12-21 12:10:54,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-21 12:10:54,313 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:54,313 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:54,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 12:10:54,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-21 12:10:54,526 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:54,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:54,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1499731437, now seen corresponding path program 1 times [2021-12-21 12:10:54,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:10:54,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618686504] [2021-12-21 12:10:54,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:54,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:10:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:54,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 12:10:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:54,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 12:10:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:54,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 12:10:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 12:10:54,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:10:54,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618686504] [2021-12-21 12:10:54,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618686504] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:10:54,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578522739] [2021-12-21 12:10:54,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:54,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:10:54,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:10:54,995 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:10:55,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 12:10:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:55,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-21 12:10:55,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:10:55,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-21 12:10:55,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:55,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-21 12:10:55,765 INFO L353 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2021-12-21 12:10:55,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2021-12-21 12:10:55,791 INFO L353 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-21 12:10:55,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 42 [2021-12-21 12:10:55,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2021-12-21 12:10:55,839 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-21 12:10:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:10:55,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:10:56,143 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| Int) (v_ArrVal_899 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_894 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_899))) (let ((.cse0 (select .cse2 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse1 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| |c_#StackHeapBarrier|)) (not (= (select .cse0 .cse1) 0)) (not (= (select (select (store (store .cse2 |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse0 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_894) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2021-12-21 12:10:56,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578522739] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:10:56,145 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:10:56,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2021-12-21 12:10:56,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947123466] [2021-12-21 12:10:56,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:10:56,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-21 12:10:56,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:10:56,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-21 12:10:56,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1077, Unknown=4, NotChecked=66, Total=1260 [2021-12-21 12:10:56,147 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-21 12:10:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:56,830 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2021-12-21 12:10:56,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 12:10:56,831 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2021-12-21 12:10:56,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:56,832 INFO L225 Difference]: With dead ends: 52 [2021-12-21 12:10:56,832 INFO L226 Difference]: Without dead ends: 49 [2021-12-21 12:10:56,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=246, Invalid=2106, Unknown=4, NotChecked=94, Total=2450 [2021-12-21 12:10:56,834 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 78 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:56,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 205 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 378 Invalid, 0 Unknown, 3 Unchecked, 0.2s Time] [2021-12-21 12:10:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-21 12:10:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2021-12-21 12:10:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:10:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2021-12-21 12:10:56,841 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 40 [2021-12-21 12:10:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:56,842 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2021-12-21 12:10:56,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-21 12:10:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2021-12-21 12:10:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-21 12:10:56,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:56,843 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:56,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 12:10:57,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:10:57,060 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1499729763, now seen corresponding path program 1 times [2021-12-21 12:10:57,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:10:57,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150304791] [2021-12-21 12:10:57,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:57,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:10:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:57,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 12:10:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:57,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 12:10:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:57,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 12:10:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:10:58,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:10:58,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150304791] [2021-12-21 12:10:58,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150304791] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:10:58,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907807834] [2021-12-21 12:10:58,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:58,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:10:58,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:10:58,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:10:58,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 12:10:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:58,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 100 conjunts are in the unsatisfiable core [2021-12-21 12:10:58,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:10:58,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 12:10:58,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:58,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:58,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:59,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-12-21 12:10:59,079 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 12:10:59,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 12:10:59,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:10:59,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-12-21 12:10:59,254 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:10:59,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-21 12:10:59,570 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:10:59,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 22 [2021-12-21 12:10:59,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 12:10:59,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:59,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 12:10:59,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:59,816 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:10:59,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 49 [2021-12-21 12:10:59,836 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-21 12:10:59,836 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-21 12:10:59,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:11:00,010 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:11:00,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 15 [2021-12-21 12:11:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:00,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:00,221 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_19| Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (or (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_1153))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_19| v_ArrVal_1154) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) 0)) (not (< |v_node_create_~temp~0#1.base_19| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_19|) 0)))) is different from false [2021-12-21 12:11:00,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907807834] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:00,223 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:00,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 46 [2021-12-21 12:11:00,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246768987] [2021-12-21 12:11:00,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:00,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-21 12:11:00,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:00,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-21 12:11:00,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2125, Unknown=6, NotChecked=92, Total=2352 [2021-12-21 12:11:00,227 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 46 states, 44 states have (on average 1.5) internal successors, (66), 38 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:01,815 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2021-12-21 12:11:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-21 12:11:01,816 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.5) internal successors, (66), 38 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2021-12-21 12:11:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:01,818 INFO L225 Difference]: With dead ends: 61 [2021-12-21 12:11:01,818 INFO L226 Difference]: Without dead ends: 36 [2021-12-21 12:11:01,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=295, Invalid=3608, Unknown=7, NotChecked=122, Total=4032 [2021-12-21 12:11:01,820 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:01,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 406 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 636 Invalid, 0 Unknown, 47 Unchecked, 0.4s Time] [2021-12-21 12:11:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-21 12:11:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2021-12-21 12:11:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:11:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2021-12-21 12:11:01,827 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 40 [2021-12-21 12:11:01,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:01,827 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2021-12-21 12:11:01,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.5) internal successors, (66), 38 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2021-12-21 12:11:01,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-21 12:11:01,828 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:01,829 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:01,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-21 12:11:02,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:02,044 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:02,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1422189688, now seen corresponding path program 1 times [2021-12-21 12:11:02,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:02,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592091045] [2021-12-21 12:11:02,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:02,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:03,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 12:11:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:03,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 12:11:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:03,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 12:11:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:03,566 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:03,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:03,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592091045] [2021-12-21 12:11:03,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592091045] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:03,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329270839] [2021-12-21 12:11:03,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:03,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:03,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:03,572 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:11:03,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 12:11:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:03,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 136 conjunts are in the unsatisfiable core [2021-12-21 12:11:03,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:03,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 12:11:04,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 12:11:04,199 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:04,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 12:11:04,420 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-21 12:11:04,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:04,527 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:04,640 INFO L353 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-12-21 12:11:04,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-12-21 12:11:04,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:04,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-12-21 12:11:04,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 12:11:04,888 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:04,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-21 12:11:04,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-21 12:11:05,289 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:11:05,289 INFO L387 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 [2021-12-21 12:11:05,301 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-21 12:11:05,301 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2021-12-21 12:11:05,308 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 12:11:05,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 12:11:05,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:05,555 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 12:11:05,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:05,576 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:05,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 64 [2021-12-21 12:11:05,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:05,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 12:11:05,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:05,604 INFO L353 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2021-12-21 12:11:05,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2021-12-21 12:11:06,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:11:06,282 INFO L353 Elim1Store]: treesize reduction 152, result has 16.0 percent of original size [2021-12-21 12:11:06,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 198 treesize of output 105 [2021-12-21 12:11:06,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:06,307 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:06,308 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 106 [2021-12-21 12:11:06,329 INFO L353 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2021-12-21 12:11:06,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2021-12-21 12:11:06,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2021-12-21 12:11:06,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:06,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 12:11:06,449 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:11:06,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 26 [2021-12-21 12:11:06,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:11:06,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:11:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 12:11:06,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:06,564 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1410 Int) (v_ArrVal_1408 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1413) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1410)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1409)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-21 12:11:06,825 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1413 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_12| Int) (v_ArrVal_1410 Int) (v_ArrVal_1408 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_12| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_1414) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1413) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 v_ArrVal_1410)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 v_ArrVal_1409)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2021-12-21 12:11:06,859 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1413 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_12| Int) (v_ArrVal_1410 Int) (v_ArrVal_1408 (Array Int Int))) (let ((.cse2 (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 ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_12| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_1414) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1413) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 v_ArrVal_1410)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 v_ArrVal_1409)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2021-12-21 12:11:07,078 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_23| Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_12| Int) (v_ArrVal_1410 Int) (v_ArrVal_1408 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23| v_ArrVal_1426)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23| v_ArrVal_1425))) (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_12| 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23| v_ArrVal_1424) .cse0 v_ArrVal_1414) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23| v_ArrVal_1413) (select (select (store (store .cse1 .cse0 (store .cse2 .cse3 v_ArrVal_1410)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23| v_ArrVal_1415) |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 v_ArrVal_1409)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select .cse2 .cse3) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23| |c_#StackHeapBarrier|))))))) is different from false [2021-12-21 12:11:07,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329270839] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:07,080 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:07,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 55 [2021-12-21 12:11:07,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177171976] [2021-12-21 12:11:07,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:07,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-21 12:11:07,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:07,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-21 12:11:07,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3113, Unknown=5, NotChecked=460, Total=3782 [2021-12-21 12:11:07,083 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 55 states, 53 states have (on average 1.320754716981132) internal successors, (70), 46 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:09,073 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2021-12-21 12:11:09,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-21 12:11:09,074 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.320754716981132) internal successors, (70), 46 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2021-12-21 12:11:09,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:09,074 INFO L225 Difference]: With dead ends: 49 [2021-12-21 12:11:09,074 INFO L226 Difference]: Without dead ends: 47 [2021-12-21 12:11:09,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=408, Invalid=5005, Unknown=5, NotChecked=588, Total=6006 [2021-12-21 12:11:09,077 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 86 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:09,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 325 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 789 Invalid, 0 Unknown, 30 Unchecked, 0.6s Time] [2021-12-21 12:11:09,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-21 12:11:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2021-12-21 12:11:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:11:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2021-12-21 12:11:09,084 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 42 [2021-12-21 12:11:09,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:09,084 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2021-12-21 12:11:09,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.320754716981132) internal successors, (70), 46 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2021-12-21 12:11:09,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-21 12:11:09,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:09,085 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:09,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 12:11:09,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:09,304 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:09,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:09,304 INFO L85 PathProgramCache]: Analyzing trace with hash 924723017, now seen corresponding path program 1 times [2021-12-21 12:11:09,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:09,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513151331] [2021-12-21 12:11:09,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:09,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:09,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 12:11:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:09,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 12:11:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:09,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 12:11:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:10,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:10,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513151331] [2021-12-21 12:11:10,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513151331] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:10,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101924900] [2021-12-21 12:11:10,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:10,098 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:10,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:10,100 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:11:10,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 12:11:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:10,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 94 conjunts are in the unsatisfiable core [2021-12-21 12:11:10,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:10,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 12:11:10,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 12:11:10,474 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:10,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 12:11:10,640 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-21 12:11:10,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:10,779 INFO L353 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-12-21 12:11:10,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-12-21 12:11:10,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 12:11:10,946 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:10,946 INFO L387 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 [2021-12-21 12:11:11,290 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-21 12:11:11,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 30 [2021-12-21 12:11:11,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 12:11:11,304 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-21 12:11:11,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2021-12-21 12:11:11,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:11,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 12:11:11,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:11,480 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:11,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 61 [2021-12-21 12:11:11,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:11,498 INFO L353 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2021-12-21 12:11:11,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2021-12-21 12:11:11,869 INFO L353 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-21 12:11:11,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-12-21 12:11:11,912 INFO L353 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2021-12-21 12:11:11,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 60 [2021-12-21 12:11:11,941 INFO L353 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2021-12-21 12:11:11,942 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 102 [2021-12-21 12:11:11,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:11,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 12:11:11,966 INFO L387 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 [2021-12-21 12:11:12,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:11:12,116 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-21 12:11:12,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 23 [2021-12-21 12:11:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 12:11:12,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:12,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101924900] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:12,755 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:12,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 50 [2021-12-21 12:11:12,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109520665] [2021-12-21 12:11:12,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:12,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-21 12:11:12,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:12,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-21 12:11:12,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2975, Unknown=13, NotChecked=0, Total=3192 [2021-12-21 12:11:12,757 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 50 states, 48 states have (on average 1.5) internal successors, (72), 41 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:14,593 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2021-12-21 12:11:14,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-21 12:11:14,594 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.5) internal successors, (72), 41 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2021-12-21 12:11:14,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:14,594 INFO L225 Difference]: With dead ends: 49 [2021-12-21 12:11:14,594 INFO L226 Difference]: Without dead ends: 46 [2021-12-21 12:11:14,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=464, Invalid=5529, Unknown=13, NotChecked=0, Total=6006 [2021-12-21 12:11:14,596 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 57 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:14,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 316 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 623 Invalid, 0 Unknown, 6 Unchecked, 0.4s Time] [2021-12-21 12:11:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-21 12:11:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2021-12-21 12:11:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:11:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2021-12-21 12:11:14,604 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 44 [2021-12-21 12:11:14,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:14,604 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2021-12-21 12:11:14,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.5) internal successors, (72), 41 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2021-12-21 12:11:14,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-21 12:11:14,605 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:14,605 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:14,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-21 12:11:14,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:14,828 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:14,828 INFO L85 PathProgramCache]: Analyzing trace with hash 924724691, now seen corresponding path program 1 times [2021-12-21 12:11:14,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:14,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164394081] [2021-12-21 12:11:14,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:14,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:15,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 12:11:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:15,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 12:11:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:15,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 12:11:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:16,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:16,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164394081] [2021-12-21 12:11:16,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164394081] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:16,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450674611] [2021-12-21 12:11:16,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:16,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:16,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:16,226 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:11:16,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 12:11:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:16,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 161 conjunts are in the unsatisfiable core [2021-12-21 12:11:16,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:16,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 12:11:16,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 12:11:16,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:16,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 12:11:16,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:16,966 INFO L387 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 [2021-12-21 12:11:17,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:17,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:17,130 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 12:11:17,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:17,344 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-21 12:11:17,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-21 12:11:17,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 12:11:17,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 12:11:17,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 12:11:17,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 12:11:17,602 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:17,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 90 [2021-12-21 12:11:17,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:17,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2021-12-21 12:11:17,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-21 12:11:18,040 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:11:18,040 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 43 [2021-12-21 12:11:18,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:18,047 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-12-21 12:11:18,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:11:18,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 12:11:18,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:18,287 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:18,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 80 [2021-12-21 12:11:18,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:18,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-21 12:11:18,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:18,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:18,316 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-21 12:11:18,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2021-12-21 12:11:18,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:18,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-21 12:11:19,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:11:19,103 INFO L353 Elim1Store]: treesize reduction 157, result has 13.3 percent of original size [2021-12-21 12:11:19,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 264 treesize of output 132 [2021-12-21 12:11:19,140 INFO L353 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-21 12:11:19,141 INFO L387 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 352 treesize of output 229 [2021-12-21 12:11:19,177 INFO L353 Elim1Store]: treesize reduction 124, result has 15.1 percent of original size [2021-12-21 12:11:19,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 317 treesize of output 257 [2021-12-21 12:11:19,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:19,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2021-12-21 12:11:19,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:19,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2021-12-21 12:11:19,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2021-12-21 12:11:19,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:11:19,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:19,523 INFO L353 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2021-12-21 12:11:19,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 77 [2021-12-21 12:11:19,532 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 12:11:19,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2021-12-21 12:11:19,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:11:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:19,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:19,734 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1943)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1948)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1947))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1951)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1944) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-21 12:11:19,975 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1943 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_17| Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| 4))) (or (not (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) |v_ULTIMATE.start_dll_append_~last~0#1.offset_17|)) (= (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 v_ArrVal_1943)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1948)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse1 (store .cse7 .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1947))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_ArrVal_1951)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1944) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select .cse7 .cse2) 0))))))) is different from false [2021-12-21 12:11:20,017 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1943 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_17| Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse0)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_1943)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1948)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse6 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1947))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1951)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1944) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) (not (<= (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8) |v_ULTIMATE.start_dll_append_~last~0#1.offset_17|)) (not (= 0 (select .cse6 .cse1)))))))) is different from false [2021-12-21 12:11:20,249 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| Int) (v_ArrVal_1951 Int) (v_ArrVal_1943 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_17| Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1961)) (.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1963))) (let ((.cse1 (select (select .cse10 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select .cse10 .cse1) .cse2))) (let ((.cse11 (select .cse10 .cse4)) (.cse5 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| |c_#StackHeapBarrier|)) (not (<= (select (select .cse0 .cse1) .cse2) |v_ULTIMATE.start_dll_append_~last~0#1.offset_17|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (store (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_ArrVal_1943)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1948)) (.cse6 (store (store .cse10 .cse4 (store .cse11 .cse5 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1947))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ 4 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (let ((.cse3 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1962))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_1951))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1944) (select (select .cse6 .cse7) .cse8)) (select (select .cse9 .cse7) .cse8))))) (not (= (select .cse11 .cse5) 0)))))))) is different from false [2021-12-21 12:11:20,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450674611] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:20,251 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:20,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 57 [2021-12-21 12:11:20,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747520561] [2021-12-21 12:11:20,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:20,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-12-21 12:11:20,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:20,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-12-21 12:11:20,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3585, Unknown=5, NotChecked=492, Total=4290 [2021-12-21 12:11:20,255 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 57 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 47 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:22,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:22,432 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2021-12-21 12:11:22,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-21 12:11:22,433 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 47 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2021-12-21 12:11:22,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:22,434 INFO L225 Difference]: With dead ends: 48 [2021-12-21 12:11:22,434 INFO L226 Difference]: Without dead ends: 46 [2021-12-21 12:11:22,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=388, Invalid=5629, Unknown=5, NotChecked=620, Total=6642 [2021-12-21 12:11:22,436 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:22,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 352 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 858 Invalid, 0 Unknown, 64 Unchecked, 0.6s Time] [2021-12-21 12:11:22,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-21 12:11:22,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2021-12-21 12:11:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:11:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2021-12-21 12:11:22,448 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 44 [2021-12-21 12:11:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:22,448 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2021-12-21 12:11:22,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 47 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2021-12-21 12:11:22,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-21 12:11:22,450 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:22,450 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:22,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-21 12:11:22,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:22,660 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:22,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash 478170515, now seen corresponding path program 2 times [2021-12-21 12:11:22,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:22,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726607735] [2021-12-21 12:11:22,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:22,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:23,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 12:11:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:23,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 12:11:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:23,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 12:11:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:23,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:23,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726607735] [2021-12-21 12:11:23,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726607735] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:23,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304997595] [2021-12-21 12:11:23,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 12:11:23,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:23,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:23,525 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:11:23,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 12:11:23,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 12:11:23,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:11:23,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 167 conjunts are in the unsatisfiable core [2021-12-21 12:11:23,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:23,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 12:11:23,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 12:11:23,921 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:23,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 12:11:23,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 12:11:24,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 12:11:24,112 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-21 12:11:24,113 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:24,257 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 12:11:24,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-21 12:11:24,295 INFO L353 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-12-21 12:11:24,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-12-21 12:11:24,399 INFO L387 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 [2021-12-21 12:11:24,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 12:11:24,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 12:11:24,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:24,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-21 12:11:24,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:24,556 INFO L353 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2021-12-21 12:11:24,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 59 [2021-12-21 12:11:24,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-21 12:11:24,565 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-21 12:11:24,930 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-21 12:11:24,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 56 [2021-12-21 12:11:24,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-12-21 12:11:24,939 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Unexpected substitution problem. [2021-12-21 12:11:24,939 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:11:24,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2021-12-21 12:11:24,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468769177] [2021-12-21 12:11:24,939 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:24,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-21 12:11:24,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:24,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-21 12:11:24,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1463, Unknown=0, NotChecked=0, Total=1560 [2021-12-21 12:11:24,941 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 24 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 21 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:11:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:26,245 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2021-12-21 12:11:26,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-21 12:11:26,251 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 21 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 44 [2021-12-21 12:11:26,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:26,252 INFO L225 Difference]: With dead ends: 74 [2021-12-21 12:11:26,252 INFO L226 Difference]: Without dead ends: 62 [2021-12-21 12:11:26,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-12-21 12:11:26,253 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:26,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 209 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 12:11:26,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-21 12:11:26,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2021-12-21 12:11:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 12:11:26,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2021-12-21 12:11:26,265 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 44 [2021-12-21 12:11:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:26,265 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2021-12-21 12:11:26,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 21 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:11:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2021-12-21 12:11:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 12:11:26,267 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:26,268 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:26,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-21 12:11:26,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-21 12:11:26,471 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:26,472 INFO L85 PathProgramCache]: Analyzing trace with hash -397769244, now seen corresponding path program 2 times [2021-12-21 12:11:26,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:26,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198017614] [2021-12-21 12:11:26,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:26,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:27,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 12:11:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:27,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 12:11:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:27,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 12:11:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:27,559 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:27,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:27,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198017614] [2021-12-21 12:11:27,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198017614] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:27,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723962984] [2021-12-21 12:11:27,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 12:11:27,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:27,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:27,560 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:11:27,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 12:11:27,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 12:11:27,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:11:27,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 134 conjunts are in the unsatisfiable core [2021-12-21 12:11:27,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:27,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 12:11:28,154 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 12:11:28,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 12:11:28,224 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 12:11:28,309 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:28,310 INFO L387 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 34 treesize of output 35 [2021-12-21 12:11:28,613 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:11:28,614 INFO L387 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 54 treesize of output 25 [2021-12-21 12:11:28,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:28,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 12:11:28,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:28,822 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:28,822 INFO L387 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 62 treesize of output 56 [2021-12-21 12:11:28,836 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-21 12:11:28,836 INFO L387 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 33 treesize of output 33 [2021-12-21 12:11:28,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:28,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 12:11:29,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:29,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:29,466 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:11:29,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:29,506 INFO L353 Elim1Store]: treesize reduction 169, result has 12.9 percent of original size [2021-12-21 12:11:29,506 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 278 treesize of output 103 [2021-12-21 12:11:29,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:29,537 INFO L353 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2021-12-21 12:11:29,537 INFO L387 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 181 [2021-12-21 12:11:29,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:29,565 INFO L353 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2021-12-21 12:11:29,565 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 257 treesize of output 218 [2021-12-21 12:11:29,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:29,864 INFO L353 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-12-21 12:11:29,865 INFO L387 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 147 [2021-12-21 12:11:33,780 INFO L353 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2021-12-21 12:11:33,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 57 [2021-12-21 12:11:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:33,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:36,171 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| Int) (v_ArrVal_2478 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| v_ArrVal_2492)) (.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| v_ArrVal_2491))) (let ((.cse10 (select (select .cse8 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse11 (+ (select (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse7 (select (select .cse8 .cse10) .cse11))) (let ((.cse0 (select .cse8 .cse7)) (.cse1 (+ (select (select .cse9 .cse10) .cse11) 4))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| |c_#StackHeapBarrier|)) (not (= (select .cse0 .cse1) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35|) 0)) (not (= (let ((.cse5 (store (store .cse9 .cse7 (store (select .cse9 .cse7) .cse1 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| v_ArrVal_2478)) (.cse2 (let ((.cse6 (store .cse8 .cse7 (store .cse0 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35|)))) (store .cse6 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| (store (select .cse6 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35|) 8 .cse7))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select .cse2 (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4)))) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| 0))))))) is different from false [2021-12-21 12:11:36,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723962984] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:36,174 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:36,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 54 [2021-12-21 12:11:36,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718170584] [2021-12-21 12:11:36,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:36,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-12-21 12:11:36,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:36,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-21 12:11:36,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3714, Unknown=6, NotChecked=122, Total=4032 [2021-12-21 12:11:36,175 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 54 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 45 states have internal predecessors, (75), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:40,901 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2021-12-21 12:11:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-21 12:11:40,902 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 45 states have internal predecessors, (75), 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 46 [2021-12-21 12:11:40,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:40,902 INFO L225 Difference]: With dead ends: 63 [2021-12-21 12:11:40,902 INFO L226 Difference]: Without dead ends: 60 [2021-12-21 12:11:40,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=436, Invalid=6872, Unknown=6, NotChecked=168, Total=7482 [2021-12-21 12:11:40,904 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 46 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:40,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 438 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 844 Invalid, 0 Unknown, 54 Unchecked, 0.5s Time] [2021-12-21 12:11:40,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-21 12:11:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2021-12-21 12:11:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 12:11:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2021-12-21 12:11:40,917 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 46 [2021-12-21 12:11:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:40,917 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2021-12-21 12:11:40,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 45 states have internal predecessors, (75), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2021-12-21 12:11:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 12:11:40,918 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:40,918 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:40,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-21 12:11:41,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-21 12:11:41,127 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:41,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:41,128 INFO L85 PathProgramCache]: Analyzing trace with hash -397767570, now seen corresponding path program 2 times [2021-12-21 12:11:41,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:41,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282968601] [2021-12-21 12:11:41,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:41,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 12:11:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:41,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 12:11:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:42,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 12:11:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:42,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:42,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282968601] [2021-12-21 12:11:42,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282968601] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:42,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938333153] [2021-12-21 12:11:42,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 12:11:42,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:42,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:42,260 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:11:42,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-21 12:11:42,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 12:11:42,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:11:42,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 166 conjunts are in the unsatisfiable core [2021-12-21 12:11:42,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:42,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 12:11:42,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 12:11:42,948 INFO L353 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2021-12-21 12:11:42,949 INFO L387 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 16 [2021-12-21 12:11:43,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 12:11:43,026 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 12:11:43,112 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:43,112 INFO L387 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 [2021-12-21 12:11:43,116 INFO L387 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 31 treesize of output 31 [2021-12-21 12:11:43,447 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-12-21 12:11:43,447 INFO L387 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 104 treesize of output 49 [2021-12-21 12:11:43,450 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Unexpected substitution problem. [2021-12-21 12:11:43,450 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:11:43,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2021-12-21 12:11:43,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140650778] [2021-12-21 12:11:43,451 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:43,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-21 12:11:43,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:43,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-21 12:11:43,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1541, Unknown=0, NotChecked=0, Total=1640 [2021-12-21 12:11:43,452 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:11:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:46,403 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2021-12-21 12:11:46,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-21 12:11:46,403 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 46 [2021-12-21 12:11:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:46,404 INFO L225 Difference]: With dead ends: 68 [2021-12-21 12:11:46,404 INFO L226 Difference]: Without dead ends: 66 [2021-12-21 12:11:46,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=352, Invalid=3554, Unknown=0, NotChecked=0, Total=3906 [2021-12-21 12:11:46,405 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 172 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:46,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 247 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-21 12:11:46,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-21 12:11:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2021-12-21 12:11:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 12:11:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2021-12-21 12:11:46,416 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 46 [2021-12-21 12:11:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:46,417 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2021-12-21 12:11:46,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:11:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2021-12-21 12:11:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-21 12:11:46,417 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:46,417 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:46,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-21 12:11:46,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-21 12:11:46,618 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:46,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:46,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2512449, now seen corresponding path program 3 times [2021-12-21 12:11:46,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:46,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177516172] [2021-12-21 12:11:46,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:46,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:46,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 12:11:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:46,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 12:11:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:46,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 12:11:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-21 12:11:46,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:46,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177516172] [2021-12-21 12:11:46,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177516172] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:46,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536680829] [2021-12-21 12:11:46,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 12:11:46,732 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:46,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:46,740 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:11:46,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-21 12:11:47,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-21 12:11:47,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:11:47,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 12:11:47,838 INFO L286 TraceCheckSpWp]: Computing forward predicates...