./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 791161d1 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-?-791161d [2022-07-22 14:51:32,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:51:32,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:51:32,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:51:32,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:51:32,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:51:32,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:51:32,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:51:32,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:51:32,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:51:32,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:51:32,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:51:32,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:51:32,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:51:32,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:51:32,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:51:32,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:51:32,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:51:32,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:51:32,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:51:32,365 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:51:32,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:51:32,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:51:32,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:51:32,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:51:32,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:51:32,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:51:32,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:51:32,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:51:32,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:51:32,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:51:32,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:51:32,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:51:32,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:51:32,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:51:32,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:51:32,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:51:32,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:51:32,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:51:32,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:51:32,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:51:32,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:51:32,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:51:32,410 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:51:32,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:51:32,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:51:32,411 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:51:32,411 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:51:32,411 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:51:32,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:51:32,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:51:32,412 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:51:32,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:51:32,413 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:51:32,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:51:32,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:51:32,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:51:32,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:51:32,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:51:32,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:51:32,414 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:51:32,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:51:32,414 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:51:32,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:51:32,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:51:32,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:51:32,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:51:32,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:51:32,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:51:32,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:51:32,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:51:32,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:51:32,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:51:32,416 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:51:32,416 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:51:32,416 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:51:32,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2022-07-22 14:51:32,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:51:32,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:51:32,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:51:32,625 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:51:32,626 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:51:32,626 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-07-22 14:51:32,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96c7ed860/6202d66bda714175955df6778ca3e96e/FLAG555b72c77 [2022-07-22 14:51:33,054 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:51:33,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-07-22 14:51:33,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96c7ed860/6202d66bda714175955df6778ca3e96e/FLAG555b72c77 [2022-07-22 14:51:33,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96c7ed860/6202d66bda714175955df6778ca3e96e [2022-07-22 14:51:33,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:51:33,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:51:33,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:51:33,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:51:33,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:51:33,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:51:33" (1/1) ... [2022-07-22 14:51:33,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b8ef0d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:33, skipping insertion in model container [2022-07-22 14:51:33,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:51:33" (1/1) ... [2022-07-22 14:51:33,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:51:33,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:51:33,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-07-22 14:51:33,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:51:33,341 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:51:33,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-07-22 14:51:33,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:51:33,415 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:51:33,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:33 WrapperNode [2022-07-22 14:51:33,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:51:33,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:51:33,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:51:33,417 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:51:33,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:33" (1/1) ... [2022-07-22 14:51:33,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:33" (1/1) ... [2022-07-22 14:51:33,462 INFO L137 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2022-07-22 14:51:33,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:51:33,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:51:33,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:51:33,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:51:33,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:33" (1/1) ... [2022-07-22 14:51:33,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:33" (1/1) ... [2022-07-22 14:51:33,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:33" (1/1) ... [2022-07-22 14:51:33,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:33" (1/1) ... [2022-07-22 14:51:33,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:33" (1/1) ... [2022-07-22 14:51:33,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:33" (1/1) ... [2022-07-22 14:51:33,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:33" (1/1) ... [2022-07-22 14:51:33,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:51:33,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:51:33,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:51:33,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:51:33,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:33" (1/1) ... [2022-07-22 14:51:33,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:51:33,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:51:33,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 14:51:33,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 14:51:33,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 14:51:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 14:51:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-22 14:51:33,542 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-22 14:51:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:51:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:51:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 14:51:33,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:51:33,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:51:33,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:51:33,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 14:51:33,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:51:33,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:51:33,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:51:33,638 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:51:33,639 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:51:33,784 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:51:33,789 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:51:33,790 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 14:51:33,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:51:33 BoogieIcfgContainer [2022-07-22 14:51:33,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:51:33,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:51:33,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:51:33,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:51:33,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:51:33" (1/3) ... [2022-07-22 14:51:33,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc2da45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:51:33, skipping insertion in model container [2022-07-22 14:51:33,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:33" (2/3) ... [2022-07-22 14:51:33,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc2da45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:51:33, skipping insertion in model container [2022-07-22 14:51:33,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:51:33" (3/3) ... [2022-07-22 14:51:33,798 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2022-07-22 14:51:33,807 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:51:33,808 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:51:33,840 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:51:33,844 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d10cef8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7fed2def [2022-07-22 14:51:33,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:51:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 14:51:33,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:33,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:33,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:33,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:33,875 INFO L85 PathProgramCache]: Analyzing trace with hash 308507763, now seen corresponding path program 1 times [2022-07-22 14:51:33,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:33,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216799956] [2022-07-22 14:51:33,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:33,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:34,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 14:51:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:51:34,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:34,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216799956] [2022-07-22 14:51:34,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216799956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:34,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:34,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:51:34,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355781089] [2022-07-22 14:51:34,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:34,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:51:34,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:34,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:51:34,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:51:34,099 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:34,160 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-07-22 14:51:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:51:34,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-22 14:51:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:34,168 INFO L225 Difference]: With dead ends: 57 [2022-07-22 14:51:34,169 INFO L226 Difference]: Without dead ends: 26 [2022-07-22 14:51:34,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:51:34,173 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:34,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-22 14:51:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-22 14:51:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:34,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-22 14:51:34,208 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2022-07-22 14:51:34,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:34,208 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-22 14:51:34,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-07-22 14:51:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 14:51:34,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:34,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:34,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:51:34,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:34,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:34,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2109805219, now seen corresponding path program 1 times [2022-07-22 14:51:34,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:34,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955593896] [2022-07-22 14:51:34,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:34,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:34,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 14:51:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:51:34,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:34,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955593896] [2022-07-22 14:51:34,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955593896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:34,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:34,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:51:34,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990825840] [2022-07-22 14:51:34,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:34,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:51:34,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:34,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:51:34,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:51:34,295 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:34,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:34,335 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-07-22 14:51:34,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:51:34,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-22 14:51:34,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:34,336 INFO L225 Difference]: With dead ends: 50 [2022-07-22 14:51:34,337 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 14:51:34,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:51:34,339 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:34,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 70 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 14:51:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-07-22 14:51:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-07-22 14:51:34,347 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2022-07-22 14:51:34,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:34,347 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-07-22 14:51:34,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-07-22 14:51:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 14:51:34,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:34,350 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:34,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 14:51:34,350 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:34,351 INFO L85 PathProgramCache]: Analyzing trace with hash 493100305, now seen corresponding path program 1 times [2022-07-22 14:51:34,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:34,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859083354] [2022-07-22 14:51:34,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:34,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:34,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:51:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:34,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 14:51:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 14:51:34,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:34,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859083354] [2022-07-22 14:51:34,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859083354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:34,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:34,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:51:34,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956591602] [2022-07-22 14:51:34,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:34,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:51:34,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:34,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:51:34,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:51:34,446 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:34,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:34,497 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-07-22 14:51:34,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:51:34,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-22 14:51:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:34,498 INFO L225 Difference]: With dead ends: 55 [2022-07-22 14:51:34,498 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 14:51:34,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:51:34,506 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:34,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 14:51:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-07-22 14:51:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:51:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-07-22 14:51:34,513 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2022-07-22 14:51:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:34,514 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-07-22 14:51:34,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-07-22 14:51:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 14:51:34,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:34,516 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:34,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 14:51:34,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:34,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:34,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247597, now seen corresponding path program 1 times [2022-07-22 14:51:34,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:34,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140068307] [2022-07-22 14:51:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:34,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:34,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:51:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:34,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 14:51:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 14:51:34,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:34,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140068307] [2022-07-22 14:51:34,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140068307] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:34,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632832419] [2022-07-22 14:51:34,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:34,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:34,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:51:34,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:51:34,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 14:51:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:34,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 14:51:34,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:51:34,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:51:34,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 14:51:34,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632832419] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:51:34,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:51:34,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-07-22 14:51:34,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366887671] [2022-07-22 14:51:34,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:51:34,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 14:51:34,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:34,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 14:51:34,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:51:34,816 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 14:51:34,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:34,870 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2022-07-22 14:51:34,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:51:34,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2022-07-22 14:51:34,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:34,871 INFO L225 Difference]: With dead ends: 51 [2022-07-22 14:51:34,871 INFO L226 Difference]: Without dead ends: 32 [2022-07-22 14:51:34,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:51:34,873 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:34,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:34,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-22 14:51:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-22 14:51:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:51:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-07-22 14:51:34,885 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2022-07-22 14:51:34,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:34,885 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-07-22 14:51:34,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 14:51:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-07-22 14:51:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 14:51:34,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:34,887 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:34,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 14:51:35,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:35,105 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:35,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:35,105 INFO L85 PathProgramCache]: Analyzing trace with hash -292922041, now seen corresponding path program 1 times [2022-07-22 14:51:35,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:35,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909004849] [2022-07-22 14:51:35,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:35,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:35,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:51:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:35,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 14:51:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:35,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 14:51:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 14:51:35,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:35,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909004849] [2022-07-22 14:51:35,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909004849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:35,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:35,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 14:51:35,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113797988] [2022-07-22 14:51:35,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:35,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 14:51:35,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:35,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 14:51:35,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-22 14:51:35,256 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:35,354 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-22 14:51:35,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 14:51:35,355 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-07-22 14:51:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:35,356 INFO L225 Difference]: With dead ends: 45 [2022-07-22 14:51:35,356 INFO L226 Difference]: Without dead ends: 42 [2022-07-22 14:51:35,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-22 14:51:35,359 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 61 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:35,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 130 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:51:35,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-22 14:51:35,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-07-22 14:51:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:51:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-07-22 14:51:35,369 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 37 [2022-07-22 14:51:35,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:35,369 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-07-22 14:51:35,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-07-22 14:51:35,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 14:51:35,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:35,370 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:35,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 14:51:35,371 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:35,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:35,371 INFO L85 PathProgramCache]: Analyzing trace with hash -292920367, now seen corresponding path program 1 times [2022-07-22 14:51:35,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:35,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009643978] [2022-07-22 14:51:35,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:35,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:35,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:51:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:35,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 14:51:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:35,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 14:51:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 14:51:35,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:35,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009643978] [2022-07-22 14:51:35,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009643978] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:35,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616838547] [2022-07-22 14:51:35,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:35,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:35,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:51:35,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:51:35,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 14:51:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:35,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-22 14:51:35,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:35,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:51:36,018 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_652 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_652))))) is different from true [2022-07-22 14:51:36,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:36,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-22 14:51:36,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-22 14:51:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-07-22 14:51:36,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:51:36,138 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int)) (|v_node_create_~temp~0#1.base_13| Int)) (or (not (< |v_node_create_~temp~0#1.base_13| |c_#StackHeapBarrier|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_13| v_ArrVal_655) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0)))) is different from false [2022-07-22 14:51:36,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616838547] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:36,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:51:36,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-07-22 14:51:36,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913541470] [2022-07-22 14:51:36,141 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:51:36,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-22 14:51:36,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:36,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-22 14:51:36,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=525, Unknown=2, NotChecked=94, Total=702 [2022-07-22 14:51:36,143 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-22 14:51:36,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:36,426 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-07-22 14:51:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 14:51:36,426 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2022-07-22 14:51:36,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:36,427 INFO L225 Difference]: With dead ends: 39 [2022-07-22 14:51:36,427 INFO L226 Difference]: Without dead ends: 32 [2022-07-22 14:51:36,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=856, Unknown=2, NotChecked=122, Total=1122 [2022-07-22 14:51:36,428 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:36,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 214 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 261 Invalid, 0 Unknown, 30 Unchecked, 0.2s Time] [2022-07-22 14:51:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-22 14:51:36,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-22 14:51:36,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:51:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-07-22 14:51:36,432 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2022-07-22 14:51:36,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:36,432 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-07-22 14:51:36,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-22 14:51:36,432 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-07-22 14:51:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 14:51:36,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:36,433 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:36,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:51:36,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-22 14:51:36,644 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:36,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:36,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1499731437, now seen corresponding path program 1 times [2022-07-22 14:51:36,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:36,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460110499] [2022-07-22 14:51:36,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:36,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:36,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:51:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:36,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 14:51:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:36,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 14:51:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 14:51:36,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:36,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460110499] [2022-07-22 14:51:36,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460110499] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:36,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109104753] [2022-07-22 14:51:36,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:36,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:36,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:51:36,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:51:36,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 14:51:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:37,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 14:51:37,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:37,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:51:37,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:37,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-22 14:51:37,473 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-07-22 14:51:37,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-07-22 14:51:37,492 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-22 14:51:37,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 42 [2022-07-22 14:51:37,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-22 14:51:37,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-22 14:51:37,520 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:51:37,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:51:37,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| Int) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_894 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| v_ArrVal_899))) (let ((.cse1 (select .cse0 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse2 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select (select (store (store .cse0 |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse1 .cse2 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| v_ArrVal_894) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| |c_#StackHeapBarrier|)) (not (= (select .cse1 .cse2) 0)))))) is different from false [2022-07-22 14:51:37,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109104753] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:37,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:51:37,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2022-07-22 14:51:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588590924] [2022-07-22 14:51:37,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:51:37,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-22 14:51:37,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:37,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-22 14:51:37,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1077, Unknown=4, NotChecked=66, Total=1260 [2022-07-22 14:51:37,690 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-22 14:51:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:38,191 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-07-22 14:51:38,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 14:51:38,192 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2022-07-22 14:51:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:38,192 INFO L225 Difference]: With dead ends: 52 [2022-07-22 14:51:38,192 INFO L226 Difference]: Without dead ends: 49 [2022-07-22 14:51:38,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=246, Invalid=2106, Unknown=4, NotChecked=94, Total=2450 [2022-07-22 14:51:38,194 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 78 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:38,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 205 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 378 Invalid, 0 Unknown, 3 Unchecked, 0.2s Time] [2022-07-22 14:51:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-22 14:51:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2022-07-22 14:51:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:51:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-22 14:51:38,198 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 40 [2022-07-22 14:51:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:38,198 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-22 14:51:38,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-22 14:51:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-22 14:51:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 14:51:38,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:38,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:38,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 14:51:38,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:38,400 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:38,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:38,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1499729763, now seen corresponding path program 1 times [2022-07-22 14:51:38,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:38,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225916196] [2022-07-22 14:51:38,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:38,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:38,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:51:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:38,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 14:51:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:38,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 14:51:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:51:39,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:39,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225916196] [2022-07-22 14:51:39,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225916196] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:39,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966662578] [2022-07-22 14:51:39,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:39,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:39,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:51:39,140 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:51:39,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 14:51:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:39,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-22 14:51:39,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:39,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:51:39,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:39,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:39,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:39,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-22 14:51:39,846 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 14:51:39,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 14:51:39,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:51:39,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-22 14:51:39,965 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:51:39,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-22 14:51:40,211 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:51:40,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 22 [2022-07-22 14:51:40,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:51:40,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:40,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:51:40,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:40,407 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:51:40,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 49 [2022-07-22 14:51:40,421 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-22 14:51:40,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-07-22 14:51:40,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:51:40,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:51:40,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 15 [2022-07-22 14:51:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:51:40,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:51:40,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_19| Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (or (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_1153))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_19| v_ArrVal_1154) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) 0)) (not (< |v_node_create_~temp~0#1.base_19| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_19|) 0)))) is different from false [2022-07-22 14:51:40,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966662578] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:40,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:51:40,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 46 [2022-07-22 14:51:40,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099591225] [2022-07-22 14:51:40,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:51:40,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-22 14:51:40,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:40,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-22 14:51:40,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2125, Unknown=6, NotChecked=92, Total=2352 [2022-07-22 14:51:40,673 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 46 states, 44 states have (on average 1.5) internal successors, (66), 38 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:51:42,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:42,138 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-07-22 14:51:42,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 14:51:42,139 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.5) internal successors, (66), 38 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2022-07-22 14:51:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:42,140 INFO L225 Difference]: With dead ends: 61 [2022-07-22 14:51:42,140 INFO L226 Difference]: Without dead ends: 36 [2022-07-22 14:51:42,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=295, Invalid=3608, Unknown=7, NotChecked=122, Total=4032 [2022-07-22 14:51:42,142 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:42,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 383 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 657 Invalid, 0 Unknown, 49 Unchecked, 0.4s Time] [2022-07-22 14:51:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-22 14:51:42,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-07-22 14:51:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:51:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-07-22 14:51:42,146 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 40 [2022-07-22 14:51:42,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:42,146 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-07-22 14:51:42,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.5) internal successors, (66), 38 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:51:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-07-22 14:51:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-22 14:51:42,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:42,147 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:42,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 14:51:42,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:42,372 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:42,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:42,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1422189688, now seen corresponding path program 1 times [2022-07-22 14:51:42,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:42,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070244182] [2022-07-22 14:51:42,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:42,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:43,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:51:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:43,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 14:51:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:43,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 14:51:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:51:43,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:43,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070244182] [2022-07-22 14:51:43,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070244182] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:43,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419825238] [2022-07-22 14:51:43,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:43,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:43,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:51:43,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:51:43,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 14:51:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:43,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 136 conjunts are in the unsatisfiable core [2022-07-22 14:51:43,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:43,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:51:43,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:51:43,978 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:51:43,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-22 14:51:44,144 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:51:44,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:51:44,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:51:44,286 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-22 14:51:44,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-07-22 14:51:44,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:44,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-22 14:51:44,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:51:44,475 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:51:44,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-22 14:51:44,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-22 14:51:44,780 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:51:44,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2022-07-22 14:51:44,788 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:51:44,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-07-22 14:51:44,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:51:44,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:51:44,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:44,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:51:44,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:45,004 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:51:45,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 64 [2022-07-22 14:51:45,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:45,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 14:51:45,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:45,027 INFO L356 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-07-22 14:51:45,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2022-07-22 14:51:45,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:51:45,579 INFO L356 Elim1Store]: treesize reduction 152, result has 16.0 percent of original size [2022-07-22 14:51:45,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 198 treesize of output 105 [2022-07-22 14:51:45,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:45,599 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:51:45,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 106 [2022-07-22 14:51:45,615 INFO L356 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2022-07-22 14:51:45,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2022-07-22 14:51:45,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-07-22 14:51:45,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:45,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:51:45,704 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:51:45,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 26 [2022-07-22 14:51:45,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:51:45,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:51:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:51:45,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:51:45,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1410 Int) (v_ArrVal_1408 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1413) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1410)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1409)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-22 14:51:46,012 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1410 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_11| Int) (v_ArrVal_1408 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_11| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_1414) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1413) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 v_ArrVal_1410)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 v_ArrVal_1409)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-22 14:51:46,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1410 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_11| Int) (v_ArrVal_1408 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_11| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1414) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1413) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 v_ArrVal_1410)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 v_ArrVal_1409)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select .cse1 .cse2) 0)))))) is different from false [2022-07-22 14:51:46,224 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1415 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| Int) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1410 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_11| Int) (v_ArrVal_1408 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1426)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1425))) (let ((.cse2 (select (select .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ 4 (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))))) (let ((.cse0 (select .cse3 .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_11| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1424) .cse2 v_ArrVal_1414) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1413) (select (select (store (store .cse3 .cse2 (store .cse0 .cse1 v_ArrVal_1410)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse2 (store (select .cse4 .cse2) .cse1 v_ArrVal_1409)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-07-22 14:51:46,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419825238] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:46,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:51:46,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 55 [2022-07-22 14:51:46,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780405000] [2022-07-22 14:51:46,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:51:46,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-22 14:51:46,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:46,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-22 14:51:46,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3112, Unknown=6, NotChecked=460, Total=3782 [2022-07-22 14:51:46,228 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 55 states, 53 states have (on average 1.320754716981132) internal successors, (70), 46 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:51:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:48,072 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-07-22 14:51:48,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 14:51:48,075 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.320754716981132) internal successors, (70), 46 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2022-07-22 14:51:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:48,076 INFO L225 Difference]: With dead ends: 49 [2022-07-22 14:51:48,076 INFO L226 Difference]: Without dead ends: 47 [2022-07-22 14:51:48,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=408, Invalid=5004, Unknown=6, NotChecked=588, Total=6006 [2022-07-22 14:51:48,078 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 86 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:48,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 295 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 819 Invalid, 0 Unknown, 30 Unchecked, 0.5s Time] [2022-07-22 14:51:48,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-22 14:51:48,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-07-22 14:51:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:51:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-07-22 14:51:48,085 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 42 [2022-07-22 14:51:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:48,085 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-07-22 14:51:48,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.320754716981132) internal successors, (70), 46 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:51:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-07-22 14:51:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 14:51:48,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:48,089 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:48,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 14:51:48,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:48,295 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:48,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:48,296 INFO L85 PathProgramCache]: Analyzing trace with hash 924723017, now seen corresponding path program 1 times [2022-07-22 14:51:48,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:48,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628389451] [2022-07-22 14:51:48,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:48,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:48,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:51:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:48,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 14:51:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:48,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 14:51:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:51:48,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:48,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628389451] [2022-07-22 14:51:48,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628389451] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:48,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216321405] [2022-07-22 14:51:48,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:48,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:48,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:51:48,936 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:51:48,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 14:51:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:49,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-22 14:51:49,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:49,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:51:49,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:51:49,221 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:51:49,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-22 14:51:49,338 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:51:49,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:51:49,430 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-22 14:51:49,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-07-22 14:51:49,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:51:49,571 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:51:49,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-22 14:51:49,823 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 14:51:49,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 30 [2022-07-22 14:51:49,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:51:49,840 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:51:49,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-07-22 14:51:49,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:49,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:51:49,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:49,980 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:51:49,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 61 [2022-07-22 14:51:49,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:49,993 INFO L356 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-07-22 14:51:49,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2022-07-22 14:51:50,288 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-22 14:51:50,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2022-07-22 14:51:50,315 INFO L356 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2022-07-22 14:51:50,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 60 [2022-07-22 14:51:50,340 INFO L356 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-07-22 14:51:50,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 102 [2022-07-22 14:51:50,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:50,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 14:51:50,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-07-22 14:51:50,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:51:50,473 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 14:51:50,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 23 [2022-07-22 14:51:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 14:51:50,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:51:50,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216321405] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:50,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:51:50,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 50 [2022-07-22 14:51:50,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517686157] [2022-07-22 14:51:50,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:51:50,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-22 14:51:50,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:50,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-22 14:51:50,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2979, Unknown=9, NotChecked=0, Total=3192 [2022-07-22 14:51:50,984 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 50 states, 48 states have (on average 1.5) internal successors, (72), 41 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:51:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:52,675 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-07-22 14:51:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-22 14:51:52,681 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.5) internal successors, (72), 41 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2022-07-22 14:51:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:52,681 INFO L225 Difference]: With dead ends: 49 [2022-07-22 14:51:52,681 INFO L226 Difference]: Without dead ends: 46 [2022-07-22 14:51:52,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=464, Invalid=5533, Unknown=9, NotChecked=0, Total=6006 [2022-07-22 14:51:52,683 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 57 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:52,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 316 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 623 Invalid, 0 Unknown, 6 Unchecked, 0.3s Time] [2022-07-22 14:51:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-22 14:51:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2022-07-22 14:51:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:51:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-07-22 14:51:52,709 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 44 [2022-07-22 14:51:52,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:52,710 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-07-22 14:51:52,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.5) internal successors, (72), 41 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:51:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-07-22 14:51:52,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 14:51:52,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:52,711 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:52,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 14:51:52,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:52,920 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:52,920 INFO L85 PathProgramCache]: Analyzing trace with hash 924724691, now seen corresponding path program 1 times [2022-07-22 14:51:52,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:52,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340408086] [2022-07-22 14:51:52,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:52,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:53,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:51:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:53,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 14:51:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:53,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 14:51:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:51:54,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:54,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340408086] [2022-07-22 14:51:54,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340408086] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:54,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294970612] [2022-07-22 14:51:54,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:54,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:54,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:51:54,038 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:51:54,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 14:51:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:54,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 161 conjunts are in the unsatisfiable core [2022-07-22 14:51:54,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:54,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:51:54,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:51:54,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:54,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-22 14:51:54,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:54,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-22 14:51:54,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:54,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:51:54,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:51:54,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:54,924 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-22 14:51:54,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-22 14:51:54,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:51:55,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:51:55,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:51:55,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:51:55,115 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:51:55,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 90 [2022-07-22 14:51:55,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:55,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2022-07-22 14:51:55,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-22 14:51:55,492 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:51:55,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 43 [2022-07-22 14:51:55,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:55,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-22 14:51:55,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:51:55,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:51:55,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:55,711 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:51:55,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 80 [2022-07-22 14:51:55,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:55,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-22 14:51:55,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:55,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:55,731 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-22 14:51:55,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-07-22 14:51:55,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:55,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-22 14:51:56,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:56,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:51:56,400 INFO L356 Elim1Store]: treesize reduction 153, result has 15.5 percent of original size [2022-07-22 14:51:56,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 264 treesize of output 136 [2022-07-22 14:51:56,428 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-22 14:51:56,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 328 treesize of output 205 [2022-07-22 14:51:56,457 INFO L356 Elim1Store]: treesize reduction 124, result has 15.1 percent of original size [2022-07-22 14:51:56,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 249 treesize of output 205 [2022-07-22 14:51:56,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:56,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2022-07-22 14:51:56,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:56,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-07-22 14:51:56,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-07-22 14:51:56,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:51:56,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:56,740 INFO L356 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-07-22 14:51:56,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 77 [2022-07-22 14:51:56,748 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-22 14:51:56,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-22 14:51:56,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:51:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:51:56,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:51:56,930 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1943)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1948)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1947))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1951)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1944) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-22 14:51:57,134 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1951 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_16| Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (let ((.cse7 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_16| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 v_ArrVal_1943)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1948)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1947))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse2 (store (select |c_#memory_int| .cse2) .cse1 v_ArrVal_1951)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1944) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7) |v_ULTIMATE.start_dll_append_~last~0#1.offset_16|))))))) is different from false [2022-07-22 14:51:57,159 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1951 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_16| Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse0)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_16| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_1943)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1948)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse6 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1947))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1951)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1944) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) (not (<= (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8) |v_ULTIMATE.start_dll_append_~last~0#1.offset_16|)) (not (= (select .cse6 .cse1) 0))))))) is different from false [2022-07-22 14:51:57,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| Int) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1951 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_16| Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1961)) (.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1963))) (let ((.cse1 (select (select .cse11 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse6 (select (select .cse11 .cse1) .cse2))) (let ((.cse3 (select .cse11 .cse6)) (.cse4 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_16| 4))) (or (not (<= (select (select .cse0 .cse1) .cse2) |v_ULTIMATE.start_dll_append_~last~0#1.offset_16|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| |c_#StackHeapBarrier|)) (not (= (select .cse3 .cse4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (store (store .cse0 .cse6 (store (select .cse0 .cse6) .cse4 v_ArrVal_1943)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1948)) (.cse7 (store (store .cse11 .cse6 (store .cse3 .cse4 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1947))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse5 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1962))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse4 v_ArrVal_1951))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1944) (select (select .cse7 .cse8) .cse9)) (select (select .cse10 .cse8) .cse9))))))))))) is different from false [2022-07-22 14:51:57,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294970612] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:57,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:51:57,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 57 [2022-07-22 14:51:57,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405324872] [2022-07-22 14:51:57,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:51:57,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-22 14:51:57,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:57,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-22 14:51:57,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3586, Unknown=4, NotChecked=492, Total=4290 [2022-07-22 14:51:57,355 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 57 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 47 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:51:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:59,237 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-07-22 14:51:59,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 14:51:59,238 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 47 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2022-07-22 14:51:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:59,239 INFO L225 Difference]: With dead ends: 48 [2022-07-22 14:51:59,239 INFO L226 Difference]: Without dead ends: 46 [2022-07-22 14:51:59,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=388, Invalid=5630, Unknown=4, NotChecked=620, Total=6642 [2022-07-22 14:51:59,241 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:59,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 337 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 872 Invalid, 0 Unknown, 65 Unchecked, 0.5s Time] [2022-07-22 14:51:59,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-22 14:51:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-07-22 14:51:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:51:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-07-22 14:51:59,249 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 44 [2022-07-22 14:51:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:59,250 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-07-22 14:51:59,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 47 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:51:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-07-22 14:51:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 14:51:59,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:59,251 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:59,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 14:51:59,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:59,459 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:59,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:59,460 INFO L85 PathProgramCache]: Analyzing trace with hash 478170515, now seen corresponding path program 2 times [2022-07-22 14:51:59,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:59,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280097205] [2022-07-22 14:51:59,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:59,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:59,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:51:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:59,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 14:51:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:00,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 14:52:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:52:00,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:52:00,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280097205] [2022-07-22 14:52:00,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280097205] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:52:00,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462078959] [2022-07-22 14:52:00,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:52:00,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:52:00,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:52:00,216 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:52:00,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 14:52:00,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:52:00,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:52:00,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 167 conjunts are in the unsatisfiable core [2022-07-22 14:52:00,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:00,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:52:00,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:52:00,527 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:52:00,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-22 14:52:00,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:52:00,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:52:00,682 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:52:00,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:52:00,821 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:52:00,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-22 14:52:00,856 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-22 14:52:00,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-07-22 14:52:00,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-22 14:52:00,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:52:00,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:52:00,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:00,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-22 14:52:01,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:01,035 INFO L356 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2022-07-22 14:52:01,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 59 [2022-07-22 14:52:01,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-22 14:52:01,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-22 14:52:01,408 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-22 14:52:01,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 56 [2022-07-22 14:52:01,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-07-22 14:52:01,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:52:01,421 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:52:01,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-07-22 14:52:01,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:01,631 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-22 14:52:01,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 126 treesize of output 116 [2022-07-22 14:52:01,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:01,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-22 14:52:01,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:01,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:01,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 98 [2022-07-22 14:52:01,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:01,660 INFO L356 Elim1Store]: treesize reduction 30, result has 47.4 percent of original size [2022-07-22 14:52:01,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 39 [2022-07-22 14:52:02,435 INFO L356 Elim1Store]: treesize reduction 262, result has 13.0 percent of original size [2022-07-22 14:52:02,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 14 case distinctions, treesize of input 372 treesize of output 153 [2022-07-22 14:52:02,470 INFO L356 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2022-07-22 14:52:02,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 212 treesize of output 196 [2022-07-22 14:52:02,485 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-22 14:52:02,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 128 [2022-07-22 14:52:02,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:02,500 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-22 14:52:02,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 145 [2022-07-22 14:52:02,525 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:52:02,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 41 [2022-07-22 14:52:02,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:52:02,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-07-22 14:52:02,774 INFO L356 Elim1Store]: treesize reduction 90, result has 25.6 percent of original size [2022-07-22 14:52:02,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 251 treesize of output 137 [2022-07-22 14:52:02,795 INFO L356 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-07-22 14:52:02,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 143 [2022-07-22 14:52:02,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:52:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:52:03,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:52:03,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_2223) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2232) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2229) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-22 14:52:03,521 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (let ((.cse2 (let ((.cse3 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse3)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse3) 4))))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_2223) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2232) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2229) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-22 14:52:03,543 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (+ (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 4))))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_2223) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2232) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2229) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= 0 (select .cse1 .cse2))))))) is different from false [2022-07-22 14:52:03,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (+ (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 4))))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_2223) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2232) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2229) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= 0 (select .cse1 .cse2))))))) is different from false [2022-07-22 14:52:03,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| Int) (v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2244 (Array Int Int)) (v_ArrVal_2243 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2242 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2244)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2242))) (let ((.cse0 (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (select .cse1 (select (select .cse1 .cse5) .cse6)) (+ (select (select .cse4 .cse5) .cse6) 4))))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2243) .cse0 v_ArrVal_2223) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2232) (select (select (store (store .cse1 .cse0 (store .cse2 .cse3 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2226) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse0 (store (select .cse4 .cse0) .cse3 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2229) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27|) 0)) (not (= (select .cse2 .cse3) 0))))))) is different from false [2022-07-22 14:52:03,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462078959] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:52:03,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:52:03,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31] total 53 [2022-07-22 14:52:03,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646610408] [2022-07-22 14:52:03,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:52:03,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-22 14:52:03,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:52:03,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-22 14:52:03,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3210, Unknown=58, NotChecked=590, Total=4032 [2022-07-22 14:52:03,640 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 53 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:52:06,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:52:06,005 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2022-07-22 14:52:06,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 14:52:06,005 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2022-07-22 14:52:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:52:06,006 INFO L225 Difference]: With dead ends: 73 [2022-07-22 14:52:06,006 INFO L226 Difference]: Without dead ends: 61 [2022-07-22 14:52:06,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=312, Invalid=5340, Unknown=68, NotChecked=760, Total=6480 [2022-07-22 14:52:06,008 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 14:52:06,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 462 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1085 Invalid, 0 Unknown, 135 Unchecked, 0.7s Time] [2022-07-22 14:52:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-22 14:52:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-07-22 14:52:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-22 14:52:06,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-07-22 14:52:06,016 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 44 [2022-07-22 14:52:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:52:06,016 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-07-22 14:52:06,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:52:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-07-22 14:52:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-22 14:52:06,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:52:06,017 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:52:06,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 14:52:06,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-22 14:52:06,228 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:52:06,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:52:06,228 INFO L85 PathProgramCache]: Analyzing trace with hash -397769244, now seen corresponding path program 2 times [2022-07-22 14:52:06,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:52:06,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914934410] [2022-07-22 14:52:06,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:06,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:52:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:06,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:52:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:06,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 14:52:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:06,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 14:52:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:52:07,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:52:07,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914934410] [2022-07-22 14:52:07,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914934410] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:52:07,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824286659] [2022-07-22 14:52:07,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:52:07,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:52:07,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:52:07,116 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:52:07,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 14:52:07,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:52:07,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:52:07,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 158 conjunts are in the unsatisfiable core [2022-07-22 14:52:07,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:07,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:52:07,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:52:07,489 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-22 14:52:07,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 14:52:07,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-22 14:52:07,690 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 582297 column 46: unknown constant v_old(#valid)_AFTER_CALL_24 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 14:52:07,694 INFO L158 Benchmark]: Toolchain (without parser) took 34620.51ms. Allocated memory was 90.2MB in the beginning and 232.8MB in the end (delta: 142.6MB). Free memory was 49.9MB in the beginning and 127.5MB in the end (delta: -77.6MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2022-07-22 14:52:07,694 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 90.2MB. Free memory was 67.9MB in the beginning and 67.9MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:52:07,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.89ms. Allocated memory is still 90.2MB. Free memory was 49.7MB in the beginning and 57.6MB in the end (delta: -7.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 14:52:07,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.38ms. Allocated memory is still 90.2MB. Free memory was 57.6MB in the beginning and 55.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:52:07,694 INFO L158 Benchmark]: Boogie Preprocessor took 23.59ms. Allocated memory is still 90.2MB. Free memory was 55.5MB in the beginning and 53.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:52:07,694 INFO L158 Benchmark]: RCFGBuilder took 304.65ms. Allocated memory is still 90.2MB. Free memory was 53.6MB in the beginning and 39.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-22 14:52:07,695 INFO L158 Benchmark]: TraceAbstraction took 33900.80ms. Allocated memory was 90.2MB in the beginning and 232.8MB in the end (delta: 142.6MB). Free memory was 38.9MB in the beginning and 127.5MB in the end (delta: -88.6MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2022-07-22 14:52:07,695 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 90.2MB. Free memory was 67.9MB in the beginning and 67.9MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.89ms. Allocated memory is still 90.2MB. Free memory was 49.7MB in the beginning and 57.6MB in the end (delta: -7.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.38ms. Allocated memory is still 90.2MB. Free memory was 57.6MB in the beginning and 55.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.59ms. Allocated memory is still 90.2MB. Free memory was 55.5MB in the beginning and 53.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 304.65ms. Allocated memory is still 90.2MB. Free memory was 53.6MB in the beginning and 39.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 33900.80ms. Allocated memory was 90.2MB in the beginning and 232.8MB in the end (delta: 142.6MB). Free memory was 38.9MB in the beginning and 127.5MB in the end (delta: -88.6MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 582297 column 46: unknown constant v_old(#valid)_AFTER_CALL_24 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 582297 column 46: unknown constant v_old(#valid)_AFTER_CALL_24: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 14:52:07,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:52:09,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:52:09,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:52:09,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:52:09,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:52:09,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:52:09,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:52:09,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:52:09,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:52:09,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:52:09,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:52:09,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:52:09,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:52:09,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:52:09,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:52:09,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:52:09,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:52:09,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:52:09,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:52:09,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:52:09,465 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:52:09,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:52:09,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:52:09,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:52:09,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:52:09,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:52:09,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:52:09,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:52:09,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:52:09,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:52:09,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:52:09,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:52:09,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:52:09,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:52:09,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:52:09,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:52:09,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:52:09,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:52:09,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:52:09,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:52:09,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:52:09,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:52:09,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 14:52:09,511 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:52:09,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:52:09,512 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:52:09,512 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:52:09,513 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:52:09,513 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:52:09,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:52:09,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:52:09,514 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:52:09,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:52:09,515 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:52:09,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:52:09,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:52:09,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:52:09,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:52:09,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:52:09,516 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 14:52:09,516 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 14:52:09,516 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 14:52:09,517 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:52:09,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:52:09,517 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:52:09,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:52:09,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:52:09,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:52:09,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:52:09,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:52:09,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:52:09,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:52:09,518 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:52:09,519 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 14:52:09,519 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 14:52:09,519 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:52:09,519 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:52:09,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:52:09,519 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 14:52:09,520 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2022-07-22 14:52:09,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:52:09,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:52:09,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:52:09,791 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:52:09,791 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:52:09,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-07-22 14:52:09,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed4b7e58/c8c35d3672c746a287658fe9d5c2ec75/FLAGb8d410216 [2022-07-22 14:52:10,217 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:52:10,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-07-22 14:52:10,226 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed4b7e58/c8c35d3672c746a287658fe9d5c2ec75/FLAGb8d410216 [2022-07-22 14:52:10,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed4b7e58/c8c35d3672c746a287658fe9d5c2ec75 [2022-07-22 14:52:10,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:52:10,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:52:10,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:52:10,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:52:10,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:52:10,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:52:10" (1/1) ... [2022-07-22 14:52:10,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf503b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:52:10, skipping insertion in model container [2022-07-22 14:52:10,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:52:10" (1/1) ... [2022-07-22 14:52:10,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:52:10,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:52:10,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-07-22 14:52:10,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:52:10,532 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:52:10,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-07-22 14:52:10,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:52:10,606 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:52:10,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:52:10 WrapperNode [2022-07-22 14:52:10,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:52:10,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:52:10,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:52:10,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:52:10,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:52:10" (1/1) ... [2022-07-22 14:52:10,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:52:10" (1/1) ... [2022-07-22 14:52:10,664 INFO L137 Inliner]: procedures = 130, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 123 [2022-07-22 14:52:10,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:52:10,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:52:10,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:52:10,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:52:10,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:52:10" (1/1) ... [2022-07-22 14:52:10,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:52:10" (1/1) ... [2022-07-22 14:52:10,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:52:10" (1/1) ... [2022-07-22 14:52:10,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:52:10" (1/1) ... [2022-07-22 14:52:10,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:52:10" (1/1) ... [2022-07-22 14:52:10,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:52:10" (1/1) ... [2022-07-22 14:52:10,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:52:10" (1/1) ... [2022-07-22 14:52:10,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:52:10,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:52:10,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:52:10,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:52:10,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:52:10" (1/1) ... [2022-07-22 14:52:10,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:52:10,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:52:10,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 14:52:10,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 14:52:10,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 14:52:10,798 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-22 14:52:10,798 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-22 14:52:10,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:52:10,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:52:10,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 14:52:10,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:52:10,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:52:10,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:52:10,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 14:52:10,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 14:52:10,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 14:52:10,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:52:10,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:52:10,914 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:52:10,915 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:52:11,188 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:52:11,193 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:52:11,193 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 14:52:11,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:52:11 BoogieIcfgContainer [2022-07-22 14:52:11,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:52:11,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:52:11,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:52:11,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:52:11,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:52:10" (1/3) ... [2022-07-22 14:52:11,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adfcee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:52:11, skipping insertion in model container [2022-07-22 14:52:11,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:52:10" (2/3) ... [2022-07-22 14:52:11,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adfcee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:52:11, skipping insertion in model container [2022-07-22 14:52:11,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:52:11" (3/3) ... [2022-07-22 14:52:11,199 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2022-07-22 14:52:11,221 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:52:11,221 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:52:11,279 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:52:11,285 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@354b01d5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@57344957 [2022-07-22 14:52:11,285 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:52:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:52:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 14:52:11,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:52:11,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:52:11,294 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:52:11,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:52:11,299 INFO L85 PathProgramCache]: Analyzing trace with hash 308507763, now seen corresponding path program 1 times [2022-07-22 14:52:11,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:52:11,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531214073] [2022-07-22 14:52:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:11,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:52:11,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:52:11,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:52:11,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 14:52:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:11,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 14:52:11,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:52:11,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:52:11,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:52:11,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531214073] [2022-07-22 14:52:11,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531214073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:52:11,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:52:11,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:52:11,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357211330] [2022-07-22 14:52:11,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:52:11,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:52:11,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:52:11,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:52:11,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:52:11,490 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:52:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:52:11,502 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-07-22 14:52:11,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:52:11,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-22 14:52:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:52:11,508 INFO L225 Difference]: With dead ends: 57 [2022-07-22 14:52:11,511 INFO L226 Difference]: Without dead ends: 26 [2022-07-22 14:52:11,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:52:11,518 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:52:11,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:52:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-22 14:52:11,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-22 14:52:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:52:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-22 14:52:11,555 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2022-07-22 14:52:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:52:11,556 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-22 14:52:11,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:52:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-07-22 14:52:11,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 14:52:11,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:52:11,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:52:11,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-22 14:52:11,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:52:11,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:52:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:52:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2109805219, now seen corresponding path program 1 times [2022-07-22 14:52:11,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:52:11,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875399274] [2022-07-22 14:52:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:11,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:52:11,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:52:11,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:52:11,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 14:52:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:11,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 14:52:11,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:11,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:52:11,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:52:11,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:52:11,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875399274] [2022-07-22 14:52:11,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875399274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:52:11,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:52:11,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:52:11,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037504626] [2022-07-22 14:52:11,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:52:11,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:52:11,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:52:11,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:52:11,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:52:11,937 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:52:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:52:11,955 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-07-22 14:52:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:52:11,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-22 14:52:11,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:52:11,959 INFO L225 Difference]: With dead ends: 50 [2022-07-22 14:52:11,959 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 14:52:11,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:52:11,961 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:52:11,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:52:11,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 14:52:11,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-07-22 14:52:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:52:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-07-22 14:52:11,966 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2022-07-22 14:52:11,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:52:11,966 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-07-22 14:52:11,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:52:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-07-22 14:52:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 14:52:11,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:52:11,967 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:52:11,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:52:12,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:52:12,173 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:52:12,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:52:12,174 INFO L85 PathProgramCache]: Analyzing trace with hash 493100305, now seen corresponding path program 1 times [2022-07-22 14:52:12,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:52:12,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063897417] [2022-07-22 14:52:12,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:12,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:52:12,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:52:12,176 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:52:12,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 14:52:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:12,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 14:52:12,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:52:12,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:52:12,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:52:12,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063897417] [2022-07-22 14:52:12,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063897417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:52:12,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:52:12,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:52:12,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047181102] [2022-07-22 14:52:12,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:52:12,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:52:12,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:52:12,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:52:12,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:52:12,338 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:52:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:52:12,371 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-07-22 14:52:12,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:52:12,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-22 14:52:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:52:12,372 INFO L225 Difference]: With dead ends: 55 [2022-07-22 14:52:12,372 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 14:52:12,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:52:12,373 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:52:12,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:52:12,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 14:52:12,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-07-22 14:52:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:52:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-07-22 14:52:12,382 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2022-07-22 14:52:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:52:12,382 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-07-22 14:52:12,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:52:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-07-22 14:52:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 14:52:12,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:52:12,384 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:52:12,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 14:52:12,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:52:12,592 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:52:12,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:52:12,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247597, now seen corresponding path program 1 times [2022-07-22 14:52:12,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:52:12,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520209924] [2022-07-22 14:52:12,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:12,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:52:12,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:52:12,595 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:52:12,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 14:52:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:12,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 14:52:12,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:52:12,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:52:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 14:52:12,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:52:12,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520209924] [2022-07-22 14:52:12,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520209924] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:52:12,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:52:12,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-22 14:52:12,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063382707] [2022-07-22 14:52:12,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:52:12,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 14:52:12,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:52:12,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 14:52:12,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:52:12,787 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 14:52:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:52:12,832 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-07-22 14:52:12,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:52:12,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2022-07-22 14:52:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:52:12,834 INFO L225 Difference]: With dead ends: 55 [2022-07-22 14:52:12,834 INFO L226 Difference]: Without dead ends: 36 [2022-07-22 14:52:12,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:52:12,837 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:52:12,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 144 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:52:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-22 14:52:12,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-07-22 14:52:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:52:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-07-22 14:52:12,840 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2022-07-22 14:52:12,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:52:12,841 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-07-22 14:52:12,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 14:52:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-07-22 14:52:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 14:52:12,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:52:12,842 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:52:12,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-22 14:52:13,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:52:13,050 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:52:13,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:52:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash -292922041, now seen corresponding path program 1 times [2022-07-22 14:52:13,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:52:13,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072597249] [2022-07-22 14:52:13,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:13,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:52:13,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:52:13,052 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:52:13,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-22 14:52:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:13,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 14:52:13,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:13,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:52:13,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-22 14:52:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 14:52:13,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:52:13,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:52:13,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072597249] [2022-07-22 14:52:13,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072597249] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:52:13,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:52:13,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 14:52:13,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167658865] [2022-07-22 14:52:13,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:52:13,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 14:52:13,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:52:13,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 14:52:13,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 14:52:13,327 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:52:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:52:13,568 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-22 14:52:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 14:52:13,568 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-07-22 14:52:13,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:52:13,569 INFO L225 Difference]: With dead ends: 45 [2022-07-22 14:52:13,569 INFO L226 Difference]: Without dead ends: 42 [2022-07-22 14:52:13,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-22 14:52:13,570 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:52:13,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 148 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 14:52:13,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-22 14:52:13,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-07-22 14:52:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:52:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-07-22 14:52:13,574 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 37 [2022-07-22 14:52:13,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:52:13,574 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-07-22 14:52:13,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:52:13,575 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-07-22 14:52:13,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 14:52:13,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:52:13,576 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:52:13,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-22 14:52:13,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:52:13,780 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:52:13,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:52:13,780 INFO L85 PathProgramCache]: Analyzing trace with hash -292920367, now seen corresponding path program 1 times [2022-07-22 14:52:13,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:52:13,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808117222] [2022-07-22 14:52:13,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:13,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:52:13,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:52:13,782 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:52:13,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-22 14:52:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:13,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-22 14:52:13,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:14,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:52:14,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:52:14,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:14,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-22 14:52:14,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-22 14:52:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:52:14,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:52:14,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:52:14,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808117222] [2022-07-22 14:52:14,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808117222] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:52:14,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1392959698] [2022-07-22 14:52:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:14,492 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-22 14:52:14,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-22 14:52:14,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-22 14:52:14,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-07-22 14:52:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:14,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-22 14:52:14,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:15,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:52:15,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:15,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-22 14:52:15,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-22 14:52:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:52:15,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:52:15,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1392959698] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:52:15,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:52:15,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2022-07-22 14:52:15,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983408559] [2022-07-22 14:52:15,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:52:15,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-22 14:52:15,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:52:15,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-22 14:52:15,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=504, Unknown=6, NotChecked=0, Total=600 [2022-07-22 14:52:15,281 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 23 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-22 14:52:15,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:52:15,805 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-07-22 14:52:15,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 14:52:15,805 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2022-07-22 14:52:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:52:15,806 INFO L225 Difference]: With dead ends: 39 [2022-07-22 14:52:15,806 INFO L226 Difference]: Without dead ends: 32 [2022-07-22 14:52:15,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=723, Unknown=7, NotChecked=0, Total=870 [2022-07-22 14:52:15,807 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 14:52:15,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 211 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 52 Unchecked, 0.4s Time] [2022-07-22 14:52:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-22 14:52:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-22 14:52:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:52:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-07-22 14:52:15,810 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2022-07-22 14:52:15,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:52:15,811 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-07-22 14:52:15,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-22 14:52:15,811 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-07-22 14:52:15,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 14:52:15,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:52:15,811 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:52:15,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2022-07-22 14:52:16,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-22 14:52:16,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:52:16,217 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:52:16,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:52:16,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1499731437, now seen corresponding path program 1 times [2022-07-22 14:52:16,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:52:16,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337697042] [2022-07-22 14:52:16,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:16,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:52:16,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:52:16,225 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:52:16,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-22 14:52:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:16,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-22 14:52:16,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:16,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:52:16,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-22 14:52:16,773 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_516))) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (and (not (= v_arrayElimCell_8 (_ bv0 32))) (bvult v_arrayElimCell_8 |c_#StackHeapBarrier|))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-22 14:52:16,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:16,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-07-22 14:52:17,054 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-22 14:52:17,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-07-22 14:52:17,102 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-22 14:52:17,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2022-07-22 14:52:17,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-22 14:52:17,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-22 14:52:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-07-22 14:52:17,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:52:17,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_520) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-22 14:52:17,341 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (not (= (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd (_ bv4 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_520) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-22 14:52:17,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd (_ bv4 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_520) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-22 14:52:17,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:52:17,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337697042] [2022-07-22 14:52:17,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337697042] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:52:17,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1017157088] [2022-07-22 14:52:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:17,491 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-22 14:52:17,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-22 14:52:17,492 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-22 14:52:17,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-07-22 14:52:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:17,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-22 14:52:17,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:18,453 INFO L356 Elim1Store]: treesize reduction 39, result has 37.1 percent of original size [2022-07-22 14:52:18,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 70 [2022-07-22 14:52:18,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:18,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2022-07-22 14:52:18,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:18,507 INFO L356 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-07-22 14:52:18,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2022-07-22 14:52:18,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-22 14:52:18,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-22 14:52:18,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-22 14:52:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 14:52:18,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:52:18,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1017157088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:52:18,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 14:52:18,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [19] total 28 [2022-07-22 14:52:18,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638594626] [2022-07-22 14:52:18,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:52:18,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 14:52:18,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:52:18,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 14:52:18,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=774, Unknown=8, NotChecked=236, Total=1122 [2022-07-22 14:52:18,691 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:52:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:52:18,887 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-07-22 14:52:18,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 14:52:18,887 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2022-07-22 14:52:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:52:18,888 INFO L225 Difference]: With dead ends: 42 [2022-07-22 14:52:18,888 INFO L226 Difference]: Without dead ends: 39 [2022-07-22 14:52:18,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=116, Invalid=883, Unknown=9, NotChecked=252, Total=1260 [2022-07-22 14:52:18,889 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:52:18,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 154 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2022-07-22 14:52:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-22 14:52:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-07-22 14:52:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:52:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-07-22 14:52:18,893 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 40 [2022-07-22 14:52:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:52:18,893 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-07-22 14:52:18,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:52:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-07-22 14:52:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 14:52:18,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:52:18,894 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:52:18,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-22 14:52:19,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2022-07-22 14:52:19,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-22 14:52:19,304 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:52:19,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:52:19,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1499729763, now seen corresponding path program 1 times [2022-07-22 14:52:19,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:52:19,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552675834] [2022-07-22 14:52:19,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:19,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:52:19,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:52:19,307 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:52:19,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-22 14:52:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:19,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-22 14:52:19,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:19,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:52:19,732 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:52:19,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-22 14:52:19,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:52:19,841 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:52:19,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2022-07-22 14:52:20,060 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-22 14:52:20,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 32 [2022-07-22 14:52:20,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-22 14:52:20,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:52:20,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:20,248 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:52:20,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 50 [2022-07-22 14:52:20,272 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-22 14:52:20,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2022-07-22 14:52:20,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:20,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:52:20,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:52:20,472 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-22 14:52:20,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2022-07-22 14:52:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:52:20,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:52:20,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:52:20,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552675834] [2022-07-22 14:52:20,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552675834] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:52:20,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2008108894] [2022-07-22 14:52:20,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:20,717 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-22 14:52:20,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-22 14:52:20,718 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-22 14:52:20,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-07-22 14:52:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:21,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-22 14:52:21,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:21,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:52:21,569 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:52:21,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-22 14:52:21,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:52:21,806 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:52:21,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-07-22 14:52:22,262 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:52:22,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 28 [2022-07-22 14:52:22,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:52:22,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-22 14:52:22,496 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:52:22,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-22 14:52:22,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:52:22,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:22,528 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:52:22,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 57 [2022-07-22 14:52:22,552 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-22 14:52:22,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2022-07-22 14:52:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:52:23,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:52:23,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2008108894] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:52:23,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:52:23,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 42 [2022-07-22 14:52:23,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700775842] [2022-07-22 14:52:23,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:52:23,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-22 14:52:23,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:52:23,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-22 14:52:23,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1785, Unknown=9, NotChecked=0, Total=1980 [2022-07-22 14:52:23,339 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 42 states, 40 states have (on average 1.425) internal successors, (57), 33 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:52:24,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:52:24,739 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-07-22 14:52:24,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 14:52:24,739 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.425) internal successors, (57), 33 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2022-07-22 14:52:24,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:52:24,741 INFO L225 Difference]: With dead ends: 65 [2022-07-22 14:52:24,741 INFO L226 Difference]: Without dead ends: 36 [2022-07-22 14:52:24,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=291, Invalid=2455, Unknown=10, NotChecked=0, Total=2756 [2022-07-22 14:52:24,742 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 14:52:24,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 308 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 305 Invalid, 0 Unknown, 91 Unchecked, 0.8s Time] [2022-07-22 14:52:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-22 14:52:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-07-22 14:52:24,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:52:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-07-22 14:52:24,747 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 40 [2022-07-22 14:52:24,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:52:24,747 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-07-22 14:52:24,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.425) internal successors, (57), 33 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:52:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-07-22 14:52:24,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-22 14:52:24,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:52:24,748 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:52:24,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-22 14:52:24,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-07-22 14:52:25,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-22 14:52:25,161 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:52:25,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:52:25,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1422188014, now seen corresponding path program 1 times [2022-07-22 14:52:25,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:52:25,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013888861] [2022-07-22 14:52:25,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:25,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:52:25,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:52:25,163 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:52:25,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-22 14:52:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:25,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-22 14:52:25,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:25,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:52:25,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:52:25,485 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:52:25,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-22 14:52:25,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:52:25,661 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-22 14:52:25,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-22 14:52:25,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:52:25,790 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:52:25,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2022-07-22 14:52:26,105 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 14:52:26,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 31 [2022-07-22 14:52:26,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:52:26,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-22 14:52:26,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:26,277 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:52:26,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 62 [2022-07-22 14:52:26,314 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-22 14:52:26,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 40 [2022-07-22 14:52:26,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:52:26,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:52:26,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:26,919 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-22 14:52:26,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 69 [2022-07-22 14:52:27,052 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 14:52:27,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 31 [2022-07-22 14:52:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:52:27,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:52:27,150 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-22 14:52:27,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)) v_ArrVal_948) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-22 14:52:27,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))) v_ArrVal_948) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-22 14:52:27,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))) v_ArrVal_948) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-22 14:52:27,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:52:27,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013888861] [2022-07-22 14:52:27,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013888861] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:52:27,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1937095369] [2022-07-22 14:52:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:27,330 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-22 14:52:27,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-22 14:52:27,331 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-22 14:52:27,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-07-22 14:52:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:27,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-22 14:52:27,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:28,482 INFO L356 Elim1Store]: treesize reduction 70, result has 38.1 percent of original size [2022-07-22 14:52:28,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 93 [2022-07-22 14:52:28,519 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-22 14:52:28,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 65 [2022-07-22 14:52:28,600 INFO L356 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2022-07-22 14:52:28,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 99 [2022-07-22 14:52:28,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:28,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-22 14:52:29,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2022-07-22 14:52:29,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-07-22 14:52:29,382 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 14:52:29,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2022-07-22 14:52:30,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:52:30,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 122 [2022-07-22 14:52:30,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 105 [2022-07-22 14:52:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 14:52:30,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:52:30,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (or (forall ((v_ArrVal_1051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1053 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) v_ArrVal_1053)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_1052 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))))) is different from false [2022-07-22 14:52:30,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1051 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_14| (_ BitVec 32)) (v_ArrVal_1053 (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_14| (_ bv4 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_1053)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))))) is different from false [2022-07-22 14:52:30,945 INFO L356 Elim1Store]: treesize reduction 67, result has 46.8 percent of original size [2022-07-22 14:52:30,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 110 [2022-07-22 14:52:30,992 INFO L356 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2022-07-22 14:52:30,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 69 [2022-07-22 14:52:31,089 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:52:31,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 133 [2022-07-22 14:52:31,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-22 14:52:31,135 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:52:31,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2022-07-22 14:52:31,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-22 14:52:32,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1937095369] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:52:32,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:52:32,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 13] total 37 [2022-07-22 14:52:32,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385380050] [2022-07-22 14:52:32,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:52:32,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-22 14:52:32,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:52:32,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-22 14:52:32,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1656, Unknown=8, NotChecked=522, Total=2352 [2022-07-22 14:52:32,752 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 37 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 31 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-22 14:52:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:52:35,065 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-07-22 14:52:35,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 14:52:35,065 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 31 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-07-22 14:52:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:52:35,066 INFO L225 Difference]: With dead ends: 48 [2022-07-22 14:52:35,066 INFO L226 Difference]: Without dead ends: 45 [2022-07-22 14:52:35,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=318, Invalid=3120, Unknown=8, NotChecked=714, Total=4160 [2022-07-22 14:52:35,067 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 14:52:35,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 355 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 302 Invalid, 0 Unknown, 152 Unchecked, 0.7s Time] [2022-07-22 14:52:35,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-22 14:52:35,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-07-22 14:52:35,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:52:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-07-22 14:52:35,072 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 42 [2022-07-22 14:52:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:52:35,073 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-22 14:52:35,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 31 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-22 14:52:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-07-22 14:52:35,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-22 14:52:35,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:52:35,074 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:52:35,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-07-22 14:52:35,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-22 14:52:35,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:52:35,478 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:52:35,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:52:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1422189688, now seen corresponding path program 1 times [2022-07-22 14:52:35,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:52:35,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566947880] [2022-07-22 14:52:35,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:35,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:52:35,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:52:35,480 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:52:35,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-22 14:52:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:35,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-22 14:52:35,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:35,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:52:35,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:52:35,861 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:52:35,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-22 14:52:35,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:52:36,080 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-22 14:52:36,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-22 14:52:36,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:52:36,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:36,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-22 14:52:36,242 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:52:36,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-07-22 14:52:36,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-22 14:52:36,603 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 14:52:36,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 35 [2022-07-22 14:52:36,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:52:36,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:52:36,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-07-22 14:52:36,819 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:52:36,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-22 14:52:36,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:52:36,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:36,847 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:52:36,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 66 [2022-07-22 14:52:36,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:36,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 14:52:36,890 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-22 14:52:36,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2022-07-22 14:52:37,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:52:37,608 INFO L356 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2022-07-22 14:52:37,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 84 [2022-07-22 14:52:37,655 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-22 14:52:37,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 124 [2022-07-22 14:52:37,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2022-07-22 14:52:37,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:37,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2022-07-22 14:52:37,834 INFO L356 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-07-22 14:52:37,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 40 [2022-07-22 14:52:37,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:52:37,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:52:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:52:37,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:52:38,122 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1170 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1168) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1166) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1169) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-22 14:52:38,154 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1166 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (_ BitVec 32)) (v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1168) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1166) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1169) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1170) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-22 14:52:38,187 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1166 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (_ BitVec 32)) (v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1168) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1166) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1169) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1170) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-22 14:52:38,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1166 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (_ BitVec 32)) (v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1168) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1166) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (_ bv4 32)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1169) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1170) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-22 14:52:38,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:52:38,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566947880] [2022-07-22 14:52:38,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566947880] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:52:38,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [728035190] [2022-07-22 14:52:38,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:38,593 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-22 14:52:38,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-22 14:52:38,594 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-22 14:52:38,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-07-22 14:52:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:39,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-22 14:52:39,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:39,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:52:39,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:52:39,941 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:52:39,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-22 14:52:40,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:40,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-22 14:52:40,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:52:40,253 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:52:40,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-07-22 14:52:40,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-22 14:52:40,876 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:52:40,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2022-07-22 14:52:40,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:52:40,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:52:40,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:52:41,128 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:52:41,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-22 14:52:41,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:52:41,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:41,168 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:52:41,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2022-07-22 14:52:41,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:41,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 14:52:41,221 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-22 14:52:41,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-07-22 14:52:42,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:42,346 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-22 14:52:42,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 105 [2022-07-22 14:52:42,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:42,392 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-22 14:52:42,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 57 [2022-07-22 14:52:42,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:42,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:42,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2022-07-22 14:52:42,733 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:52:42,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2022-07-22 14:52:42,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:52:42,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:52:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:52:42,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:52:42,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1297) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1293) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1296) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1295) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-22 14:52:42,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1297) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1293) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1296) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1295) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-22 14:52:42,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1297) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1293) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1296) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1295) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-22 14:52:42,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1297) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1293) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1296) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1298) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1295) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-22 14:52:43,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [728035190] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:52:43,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:52:43,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 49 [2022-07-22 14:52:43,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907630101] [2022-07-22 14:52:43,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:52:43,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-22 14:52:43,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:52:43,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-22 14:52:43,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2675, Unknown=18, NotChecked=888, Total=3782 [2022-07-22 14:52:43,460 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 49 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 38 states have internal predecessors, (65), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:52:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:52:47,220 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-07-22 14:52:47,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 14:52:47,221 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 38 states have internal predecessors, (65), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2022-07-22 14:52:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:52:47,221 INFO L225 Difference]: With dead ends: 44 [2022-07-22 14:52:47,222 INFO L226 Difference]: Without dead ends: 42 [2022-07-22 14:52:47,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=377, Invalid=4607, Unknown=18, NotChecked=1160, Total=6162 [2022-07-22 14:52:47,224 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:52:47,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 301 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 418 Invalid, 0 Unknown, 195 Unchecked, 1.1s Time] [2022-07-22 14:52:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-22 14:52:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-07-22 14:52:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:52:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-07-22 14:52:47,229 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 42 [2022-07-22 14:52:47,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:52:47,229 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-07-22 14:52:47,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 38 states have internal predecessors, (65), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:52:47,229 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-07-22 14:52:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 14:52:47,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:52:47,230 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:52:47,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2022-07-22 14:52:47,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-22 14:52:47,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:52:47,634 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:52:47,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:52:47,635 INFO L85 PathProgramCache]: Analyzing trace with hash 924723017, now seen corresponding path program 1 times [2022-07-22 14:52:47,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:52:47,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561250186] [2022-07-22 14:52:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:47,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:52:47,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:52:47,636 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:52:47,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-22 14:52:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:47,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-22 14:52:47,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:47,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:52:47,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:52:48,002 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:52:48,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-22 14:52:48,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:52:48,209 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-22 14:52:48,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-22 14:52:48,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:52:48,355 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:52:48,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-07-22 14:52:48,674 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 14:52:48,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 32 [2022-07-22 14:52:48,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:52:48,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-07-22 14:52:48,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:48,857 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:52:48,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 63 [2022-07-22 14:52:48,879 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-22 14:52:48,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2022-07-22 14:52:48,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:52:49,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:49,453 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-22 14:52:49,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 92 [2022-07-22 14:52:49,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:49,484 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-22 14:52:49,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 36 [2022-07-22 14:52:49,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:52:49,754 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 14:52:49,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 31 [2022-07-22 14:52:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:52:49,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:52:49,910 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1416))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-22 14:52:49,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1415) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1416))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1413) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (_ bv0 32)))) is different from false [2022-07-22 14:52:49,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1415) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1416))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1413) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (_ bv0 32)))) is different from false [2022-07-22 14:52:49,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1415) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1416))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1413) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (_ bv0 32)))) is different from false [2022-07-22 14:52:50,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:52:50,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561250186] [2022-07-22 14:52:50,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561250186] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:52:50,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1420955288] [2022-07-22 14:52:50,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:52:50,240 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-22 14:52:50,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-22 14:52:50,242 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-22 14:52:50,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-07-22 14:52:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:52:50,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-22 14:52:50,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:52:50,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:52:51,495 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:52:51,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-22 14:52:51,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:52:51,753 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:52:51,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-22 14:52:52,289 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:52:52,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 31 [2022-07-22 14:52:52,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:52:52,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:52:52,679 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:52:52,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-22 14:52:52,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:52:52,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:52,712 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:52:52,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 62 [2022-07-22 14:52:52,744 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-22 14:52:52,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-07-22 14:52:54,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:54,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:52:54,107 INFO L356 Elim1Store]: treesize reduction 142, result has 21.5 percent of original size [2022-07-22 14:52:54,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 175 treesize of output 102 [2022-07-22 14:52:54,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:54,143 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:52:54,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 109 [2022-07-22 14:52:54,169 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-22 14:52:54,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 60 [2022-07-22 14:52:54,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:52:54,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:52:54,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:52:54,651 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:52:54,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 30 [2022-07-22 14:52:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:52:54,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:52:54,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1524 (_ BitVec 32)) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1525 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_1526)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1529))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_1524)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (_ bv0 32)))) is different from false [2022-07-22 14:52:58,675 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_24| (_ BitVec 32)) (v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1524 (_ BitVec 32)) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse3)) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_24| (_ bv4 32)))) (or (not (= (select .cse0 .cse1) (_ bv0 32))) (not (= (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse3 (store .cse0 .cse1 v_ArrVal_1526)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1529))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse1 v_ArrVal_1524)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32))))))) is different from false [2022-07-22 14:52:58,726 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_24| (_ BitVec 32)) (v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1524 (_ BitVec 32)) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse3)) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_24| (_ bv4 32)))) (or (not (= (select .cse0 .cse1) (_ bv0 32))) (not (= (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse3 (store .cse0 .cse1 v_ArrVal_1526)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1529))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse1 v_ArrVal_1524)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32))))))) is different from false [2022-07-22 14:52:58,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_24| (_ BitVec 32)) (v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1524 (_ BitVec 32)) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse3)) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_24| (_ bv4 32)))) (or (not (= (select .cse0 .cse1) (_ bv0 32))) (not (= (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse3 (store .cse0 .cse1 v_ArrVal_1526)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1529))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse1 v_ArrVal_1524)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32))))))) is different from false [2022-07-22 14:53:00,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1420955288] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:53:00,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:53:00,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 55 [2022-07-22 14:53:00,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932363927] [2022-07-22 14:53:00,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:53:00,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-22 14:53:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:53:00,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-22 14:53:00,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=3385, Unknown=19, NotChecked=1000, Total=4692 [2022-07-22 14:53:00,533 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 55 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 44 states have internal predecessors, (73), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:53:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:53:04,680 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-07-22 14:53:04,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-22 14:53:04,681 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 44 states have internal predecessors, (73), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2022-07-22 14:53:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:53:04,682 INFO L225 Difference]: With dead ends: 50 [2022-07-22 14:53:04,682 INFO L226 Difference]: Without dead ends: 47 [2022-07-22 14:53:04,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2033 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=533, Invalid=5957, Unknown=22, NotChecked=1320, Total=7832 [2022-07-22 14:53:04,684 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 51 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 14:53:04,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 318 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 263 Invalid, 0 Unknown, 232 Unchecked, 0.8s Time] [2022-07-22 14:53:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-22 14:53:04,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-07-22 14:53:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:53:04,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-07-22 14:53:04,691 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 44 [2022-07-22 14:53:04,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:53:04,691 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-07-22 14:53:04,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 44 states have internal predecessors, (73), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:53:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-07-22 14:53:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 14:53:04,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:53:04,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:53:04,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-22 14:53:04,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-07-22 14:53:05,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-22 14:53:05,106 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:53:05,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:53:05,107 INFO L85 PathProgramCache]: Analyzing trace with hash 924724691, now seen corresponding path program 1 times [2022-07-22 14:53:05,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:53:05,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035908899] [2022-07-22 14:53:05,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:53:05,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:53:05,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:53:05,108 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:53:05,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-22 14:53:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:53:05,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 98 conjunts are in the unsatisfiable core [2022-07-22 14:53:05,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:53:05,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:53:05,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:53:05,526 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:53:05,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-22 14:53:05,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:05,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-22 14:53:05,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:53:05,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:53:05,781 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:53:05,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-22 14:53:05,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:53:05,832 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-22 14:53:05,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-22 14:53:05,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:53:05,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:53:05,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:53:06,044 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:53:06,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 85 [2022-07-22 14:53:06,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-22 14:53:06,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2022-07-22 14:53:06,498 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 14:53:06,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 42 [2022-07-22 14:53:06,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:53:06,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-07-22 14:53:06,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:53:06,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:06,749 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:53:06,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 75 [2022-07-22 14:53:06,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:06,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-22 14:53:06,792 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-22 14:53:06,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2022-07-22 14:53:06,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-22 14:53:07,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:53:07,639 INFO L356 Elim1Store]: treesize reduction 127, result has 15.9 percent of original size [2022-07-22 14:53:07,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 127 [2022-07-22 14:53:07,684 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-22 14:53:07,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 401 treesize of output 274 [2022-07-22 14:53:07,736 INFO L356 Elim1Store]: treesize reduction 102, result has 16.4 percent of original size [2022-07-22 14:53:07,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 360 treesize of output 301 [2022-07-22 14:53:07,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:07,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2022-07-22 14:53:07,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2022-07-22 14:53:08,137 INFO L356 Elim1Store]: treesize reduction 45, result has 8.2 percent of original size [2022-07-22 14:53:08,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 224 treesize of output 75 [2022-07-22 14:53:08,153 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-22 14:53:08,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-22 14:53:08,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:53:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:53:08,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:53:08,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1655 (_ BitVec 32)) (v_ArrVal_1661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1654) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1661)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1660))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1655)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1663) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-22 14:53:08,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1655 (_ BitVec 32)) (v_ArrVal_1661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1663 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1654) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1661)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1660))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1655)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1663) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2022-07-22 14:53:08,749 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1655 (_ BitVec 32)) (v_ArrVal_1661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7))) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1654) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1661)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1660))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1655)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1663) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-22 14:53:08,786 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1655 (_ BitVec 32)) (v_ArrVal_1661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1663 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7))) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1654) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1661)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1660))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1655)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1663) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2022-07-22 14:53:10,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:53:10,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035908899] [2022-07-22 14:53:10,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035908899] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:53:10,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2114541577] [2022-07-22 14:53:10,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:53:10,411 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-22 14:53:10,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-22 14:53:10,412 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-22 14:53:10,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-07-22 14:53:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:53:10,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-22 14:53:10,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:53:11,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:53:11,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:11,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-22 14:53:11,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:53:11,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:53:12,195 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:53:12,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-22 14:53:12,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:53:12,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:53:12,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:53:12,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:53:12,592 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:53:12,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 84 [2022-07-22 14:53:12,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-22 14:53:12,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2022-07-22 14:53:13,371 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:53:13,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 37 [2022-07-22 14:53:13,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:53:13,383 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:53:13,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:53:13,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:53:13,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:13,646 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:53:13,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 68 [2022-07-22 14:53:13,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:13,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-22 14:53:13,678 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-22 14:53:13,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-07-22 14:53:13,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:13,694 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 14:53:13,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-22 14:53:14,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:14,912 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-22 14:53:14,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 178 treesize of output 141 [2022-07-22 14:53:14,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:14,966 INFO L356 Elim1Store]: treesize reduction 66, result has 23.3 percent of original size [2022-07-22 14:53:14,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 96 [2022-07-22 14:53:14,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:53:14,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:14,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2022-07-22 14:53:14,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-22 14:53:15,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:53:15,687 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:53:15,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 52 [2022-07-22 14:53:15,706 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-22 14:53:15,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-07-22 14:53:15,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:53:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:53:15,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:53:15,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1796 (_ BitVec 32)) (v_ArrVal_1794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1799)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1798))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|) v_ArrVal_1796)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1797) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2022-07-22 14:53:15,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1796 (_ BitVec 32)) (v_ArrVal_1794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1795) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1799)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1794) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1798))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1)) v_ArrVal_1796)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1797) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2022-07-22 14:53:16,037 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1796 (_ BitVec 32)) (v_ArrVal_1794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1795) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1799)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1794) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1798))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) v_ArrVal_1796)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1797) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))) is different from false [2022-07-22 14:53:16,098 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1796 (_ BitVec 32)) (v_ArrVal_1794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1795) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1799)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1794) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1798))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) v_ArrVal_1796)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1797) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))) is different from false [2022-07-22 14:53:20,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2114541577] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:53:20,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:53:20,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 53 [2022-07-22 14:53:20,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158747632] [2022-07-22 14:53:20,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:53:20,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-22 14:53:20,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:53:20,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-22 14:53:20,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3210, Unknown=29, NotChecked=968, Total=4422 [2022-07-22 14:53:20,130 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 41 states have internal predecessors, (70), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:53:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:53:25,364 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-07-22 14:53:25,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 14:53:25,364 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 41 states have internal predecessors, (70), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2022-07-22 14:53:25,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:53:25,365 INFO L225 Difference]: With dead ends: 51 [2022-07-22 14:53:25,365 INFO L226 Difference]: Without dead ends: 49 [2022-07-22 14:53:25,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=388, Invalid=5315, Unknown=29, NotChecked=1240, Total=6972 [2022-07-22 14:53:25,367 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 50 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-22 14:53:25,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 315 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 443 Invalid, 0 Unknown, 220 Unchecked, 1.3s Time] [2022-07-22 14:53:25,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-22 14:53:25,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-07-22 14:53:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:53:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-07-22 14:53:25,373 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 44 [2022-07-22 14:53:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:53:25,373 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-07-22 14:53:25,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 41 states have internal predecessors, (70), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:53:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-07-22 14:53:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 14:53:25,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:53:25,374 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:53:25,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-07-22 14:53:25,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-22 14:53:25,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:53:25,783 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:53:25,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:53:25,783 INFO L85 PathProgramCache]: Analyzing trace with hash 478168841, now seen corresponding path program 2 times [2022-07-22 14:53:25,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:53:25,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617570336] [2022-07-22 14:53:25,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:53:25,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:53:25,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:53:25,785 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:53:25,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-22 14:53:25,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 14:53:25,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:53:25,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-22 14:53:25,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:53:26,326 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-22 14:53:26,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 46 [2022-07-22 14:53:26,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:26,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-22 14:53:26,370 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-22 14:53:26,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 42 [2022-07-22 14:53:26,425 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-22 14:53:26,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 57 [2022-07-22 14:53:26,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-22 14:53:26,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-22 14:53:26,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-22 14:53:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 14:53:26,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:53:26,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:53:26,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617570336] [2022-07-22 14:53:26,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617570336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:53:26,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:53:26,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 14:53:26,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938200195] [2022-07-22 14:53:26,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:53:26,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 14:53:26,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:53:26,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 14:53:26,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-22 14:53:26,613 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:53:26,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:53:26,751 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-07-22 14:53:26,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 14:53:26,752 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-22 14:53:26,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:53:26,752 INFO L225 Difference]: With dead ends: 53 [2022-07-22 14:53:26,752 INFO L226 Difference]: Without dead ends: 50 [2022-07-22 14:53:26,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-22 14:53:26,753 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:53:26,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 122 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2022-07-22 14:53:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-22 14:53:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-07-22 14:53:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:53:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-07-22 14:53:26,761 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 44 [2022-07-22 14:53:26,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:53:26,762 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-07-22 14:53:26,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:53:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-07-22 14:53:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 14:53:26,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:53:26,763 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:53:26,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-22 14:53:26,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:53:26,974 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:53:26,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:53:26,975 INFO L85 PathProgramCache]: Analyzing trace with hash 478170515, now seen corresponding path program 2 times [2022-07-22 14:53:26,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:53:26,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223781900] [2022-07-22 14:53:26,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:53:26,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:53:26,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:53:26,976 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:53:26,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-22 14:53:27,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:53:27,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:53:27,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-22 14:53:27,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:53:27,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:53:27,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:53:27,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:53:27,640 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:53:27,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-22 14:53:27,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:53:27,665 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:53:27,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-22 14:53:27,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:53:27,690 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:53:27,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-22 14:53:27,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-22 14:53:27,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-22 14:53:27,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-22 14:53:27,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-22 14:53:27,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:27,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:53:27,843 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:53:27,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 59 [2022-07-22 14:53:27,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-07-22 14:53:28,166 INFO L356 Elim1Store]: treesize reduction 11, result has 66.7 percent of original size [2022-07-22 14:53:28,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 61 [2022-07-22 14:53:28,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:53:28,182 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-22 14:53:28,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2022-07-22 14:53:28,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:28,330 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-22 14:53:28,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 78 [2022-07-22 14:53:28,352 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-22 14:53:28,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-07-22 14:53:28,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:28,365 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-22 14:53:28,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2022-07-22 14:53:28,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:53:28,729 INFO L356 Elim1Store]: treesize reduction 88, result has 24.1 percent of original size [2022-07-22 14:53:28,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 103 [2022-07-22 14:53:28,765 INFO L356 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2022-07-22 14:53:28,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 29 [2022-07-22 14:53:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:53:28,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:53:29,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:53:29,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223781900] [2022-07-22 14:53:29,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223781900] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:53:29,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1683365621] [2022-07-22 14:53:29,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:53:29,223 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-22 14:53:29,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-22 14:53:29,224 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-22 14:53:29,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-07-22 14:53:29,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:53:29,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:53:29,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 112 conjunts are in the unsatisfiable core [2022-07-22 14:53:29,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:53:29,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:53:29,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:53:30,552 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:53:30,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-22 14:53:30,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:53:30,589 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:53:30,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-22 14:53:30,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-22 14:53:30,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-22 14:53:30,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:30,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-22 14:53:30,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:53:30,938 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:53:30,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 77 [2022-07-22 14:53:30,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-22 14:53:30,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-07-22 14:53:31,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:53:31,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 48 [2022-07-22 14:53:31,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:31,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:53:31,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-07-22 14:53:31,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:53:31,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:53:34,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:34,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:34,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:34,099 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-22 14:53:34,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 83 [2022-07-22 14:53:34,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:34,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 14:53:34,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:34,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:34,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:34,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:34,131 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 14:53:34,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 48 [2022-07-22 14:53:34,156 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-22 14:53:34,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-07-22 14:53:36,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:36,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:36,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:53:36,847 INFO L356 Elim1Store]: treesize reduction 275, result has 13.8 percent of original size [2022-07-22 14:53:36,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 19 case distinctions, treesize of input 523 treesize of output 210 [2022-07-22 14:53:36,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:36,919 INFO L356 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2022-07-22 14:53:36,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 400 treesize of output 292 [2022-07-22 14:53:36,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:37,020 INFO L356 Elim1Store]: treesize reduction 424, result has 8.6 percent of original size [2022-07-22 14:53:37,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 18 case distinctions, treesize of input 349 treesize of output 191 [2022-07-22 14:53:37,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:37,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:37,046 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-22 14:53:37,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 154 [2022-07-22 14:53:37,094 INFO L356 Elim1Store]: treesize reduction 55, result has 49.1 percent of original size [2022-07-22 14:53:37,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 73 [2022-07-22 14:53:37,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-07-22 14:53:37,448 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-07-22 14:53:37,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 77 [2022-07-22 14:53:37,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:37,466 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 14:53:37,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2022-07-22 14:53:37,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:53:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:53:37,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:53:38,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2157 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2160 (_ BitVec 32)) (v_ArrVal_2162 (_ BitVec 32)) (v_ArrVal_2158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2159 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2163) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2157) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_2160)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2158) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_2162)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2159) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-22 14:54:54,339 WARN L233 SmtUtils]: Spent 9.27s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 14:54:54,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1683365621] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:54:54,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:54:54,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 53 [2022-07-22 14:54:54,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901098622] [2022-07-22 14:54:54,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:54:54,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-22 14:54:54,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:54:54,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-22 14:54:54,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=4282, Unknown=20, NotChecked=132, Total=4692 [2022-07-22 14:54:54,343 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 44 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:55:31,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:55:31,927 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2022-07-22 14:55:31,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-22 14:55:31,928 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 44 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2022-07-22 14:55:31,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:55:31,928 INFO L225 Difference]: With dead ends: 79 [2022-07-22 14:55:31,928 INFO L226 Difference]: Without dead ends: 69 [2022-07-22 14:55:31,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2363 ImplicationChecksByTransitivity, 116.9s TimeCoverageRelationStatistics Valid=505, Invalid=7482, Unknown=27, NotChecked=176, Total=8190 [2022-07-22 14:55:31,930 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 55 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 372 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:55:31,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 400 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 484 Invalid, 0 Unknown, 372 Unchecked, 2.1s Time] [2022-07-22 14:55:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-22 14:55:31,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2022-07-22 14:55:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-22 14:55:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2022-07-22 14:55:31,939 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 44 [2022-07-22 14:55:31,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:55:31,939 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2022-07-22 14:55:31,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 44 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:55:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2022-07-22 14:55:31,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-22 14:55:31,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:55:31,940 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:55:31,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-22 14:55:32,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2022-07-22 14:55:32,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-22 14:55:32,348 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:55:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:55:32,348 INFO L85 PathProgramCache]: Analyzing trace with hash -397769244, now seen corresponding path program 2 times [2022-07-22 14:55:32,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:55:32,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558460061] [2022-07-22 14:55:32,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:55:32,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:55:32,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:55:32,350 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:55:32,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-22 14:55:32,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:55:32,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:55:32,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 81 conjunts are in the unsatisfiable core [2022-07-22 14:55:32,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:55:32,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:55:32,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:55:32,820 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:55:32,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-22 14:55:32,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:55:33,021 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-22 14:55:33,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-22 14:55:33,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:55:33,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:55:33,198 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:55:33,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-07-22 14:55:33,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-22 14:55:33,560 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 14:55:33,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 35 [2022-07-22 14:55:33,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:55:33,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-07-22 14:55:33,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:55:33,803 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:55:33,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 66 [2022-07-22 14:55:33,837 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-22 14:55:33,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2022-07-22 14:55:33,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-22 14:55:34,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:55:34,663 INFO L356 Elim1Store]: treesize reduction 133, result has 11.9 percent of original size [2022-07-22 14:55:34,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 105 [2022-07-22 14:55:34,725 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-22 14:55:34,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 295 treesize of output 210 [2022-07-22 14:55:34,734 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:55:34,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 164 [2022-07-22 14:55:34,773 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-22 14:55:34,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 140 [2022-07-22 14:55:35,163 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-22 14:55:35,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 114 [2022-07-22 14:55:35,360 INFO L356 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-07-22 14:55:35,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 37 [2022-07-22 14:55:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 14:55:35,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:55:35,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_2288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2286 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2288)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2286))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (bvadd (select (select .cse3 .cse1) .cse2) (_ bv4 32)))))) (_ bv0 32)))) is different from false [2022-07-22 14:55:35,845 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_2288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2286 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6)))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2288)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2286))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (bvadd (_ bv4 32) (select (select .cse3 .cse1) .cse2))))))) (_ bv0 32)))) is different from false [2022-07-22 14:55:35,912 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_2288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2286 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2288)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2286))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (bvadd (_ bv4 32) (select (select .cse3 .cse1) .cse2))))))) (_ bv0 32)))) is different from false [2022-07-22 14:55:35,960 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_2288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2286 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2288)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2286))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (bvadd (select (select .cse3 .cse1) .cse2) (_ bv4 32))))))) (_ bv0 32)))) is different from false [2022-07-22 14:55:37,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:55:37,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558460061] [2022-07-22 14:55:37,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558460061] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:55:37,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1064917735] [2022-07-22 14:55:37,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:55:37,083 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-22 14:55:37,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-22 14:55:37,085 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-22 14:55:37,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-07-22 14:55:37,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:55:37,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:55:37,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-22 14:55:37,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:55:37,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:55:38,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:55:38,784 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:55:38,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-22 14:55:38,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:55:38,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:55:39,161 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:55:39,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-07-22 14:55:39,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-22 14:55:39,979 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:55:39,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2022-07-22 14:55:39,988 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:55:39,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:55:39,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:55:40,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:55:40,539 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:55:40,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2022-07-22 14:55:40,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:55:40,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:55:40,556 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 14:55:40,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-22 14:55:40,585 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-22 14:55:40,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-07-22 14:55:41,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:55:41,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:55:41,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:55:41,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:55:41,897 INFO L356 Elim1Store]: treesize reduction 121, result has 20.4 percent of original size [2022-07-22 14:55:41,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 211 treesize of output 90 [2022-07-22 14:55:41,974 INFO L356 Elim1Store]: treesize reduction 114, result has 14.9 percent of original size [2022-07-22 14:55:41,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 322 treesize of output 245 [2022-07-22 14:55:42,678 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-07-22 14:55:42,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 133 [2022-07-22 14:55:43,264 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-22 14:55:43,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 112 treesize of output 48 [2022-07-22 14:55:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:55:43,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:55:43,952 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2405) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2407)) (.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) |c_ULTIMATE.start_dll_append_~last~0#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse0 (select (select .cse4 .cse2) .cse3))) (or (= .cse0 (_ bv0 32)) (not (= (_ bv0 32) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (bvadd (_ bv4 32) .cse0))))))))) (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2405) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2407)) (.cse7 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)))) (store .cse11 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) |c_ULTIMATE.start_dll_append_~last~0#1.base|))))) (let ((.cse9 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (bvadd (_ bv4 32) (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse6 (select (select .cse7 .cse9) .cse10))) (or (= .cse6 (_ bv0 32)) (not (= (_ bv0 32) (select (select .cse7 .cse6) (bvadd (_ bv4 32) (select (select .cse8 .cse9) .cse10))))))))))) is different from false [2022-07-22 14:55:44,103 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_2405) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2407)) (.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) .cse6))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse0 (select (select .cse4 .cse2) .cse3))) (or (= .cse0 (_ bv0 32)) (not (= (_ bv0 32) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (bvadd (_ bv4 32) .cse0))))))))))) (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse15))) (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| .cse14 v_ArrVal_2405) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2407)) (.cse8 (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse14 (store (select |c_#memory_$Pointer$.base| .cse14) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse15)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)))) (store .cse13 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) .cse14))))) (let ((.cse11 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (bvadd (_ bv4 32) (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse9 (select (select .cse8 .cse11) .cse12))) (or (not (= (_ bv0 32) (select (select .cse8 .cse9) (bvadd (_ bv4 32) (select (select .cse10 .cse11) .cse12))))) (= .cse9 (_ bv0 32)))))))))) is different from false [2022-07-22 14:55:44,228 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (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 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_2405) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2407)) (.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) .cse6))))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse1 (select (select .cse0 .cse3) .cse4))) (or (not (= (_ bv0 32) (select (select .cse0 .cse1) (bvadd (select (select .cse2 .cse3) .cse4) (_ bv4 32))))) (= .cse1 (_ bv0 32))))))))) (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse17 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| .cse16) .cse17))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| .cse15 v_ArrVal_2405) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2407)) (.cse9 (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse15 (store (select |c_#memory_$Pointer$.base| .cse15) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse16) .cse17)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)))) (store .cse14 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) .cse15))))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (bvadd (_ bv4 32) (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse12 (select (select .cse13 .cse10) .cse11))) (or (not (= (_ bv0 32) (select (select .cse9 (select (select .cse9 .cse10) .cse11)) (bvadd .cse12 (_ bv4 32))))) (= .cse12 (_ bv0 32)))))))))) is different from false [2022-07-22 14:55:44,291 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (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 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_2405) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2407)) (.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)))) (store .cse5 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|) .cse6))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse0 (select (select .cse4 .cse2) .cse3))) (or (= .cse0 (_ bv0 32)) (not (= (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (bvadd .cse0 (_ bv4 32))) (_ bv0 32)))))))))) (forall ((v_ArrVal_2407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse17 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| .cse16) .cse17))) (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| .cse15 v_ArrVal_2405) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2407)) (.cse9 (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse15 (store (select |c_#memory_$Pointer$.base| .cse15) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse16) .cse17)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)))) (store .cse14 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|) .cse15))))) (let ((.cse12 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (bvadd (_ bv4 32) (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse10 (select (select .cse9 .cse12) .cse13))) (or (not (= (select (select .cse9 .cse10) (bvadd (select (select .cse11 .cse12) .cse13) (_ bv4 32))) (_ bv0 32))) (= .cse10 (_ bv0 32)))))))))) is different from false