./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 c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/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-tmp.no-commuhash-c3fed41 [2021-12-15 23:56:34,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 23:56:34,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 23:56:34,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 23:56:34,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 23:56:34,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 23:56:34,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 23:56:34,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 23:56:34,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 23:56:34,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 23:56:34,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 23:56:34,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 23:56:34,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 23:56:34,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 23:56:34,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 23:56:34,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 23:56:34,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 23:56:34,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 23:56:34,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 23:56:34,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 23:56:34,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 23:56:34,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 23:56:34,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 23:56:34,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 23:56:34,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 23:56:34,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 23:56:34,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 23:56:34,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 23:56:34,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 23:56:34,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 23:56:34,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 23:56:34,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 23:56:34,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 23:56:34,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 23:56:34,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 23:56:34,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 23:56:34,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 23:56:34,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 23:56:34,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 23:56:34,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 23:56:34,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 23:56:34,270 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 23:56:34,293 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 23:56:34,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 23:56:34,293 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 23:56:34,294 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 23:56:34,294 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 23:56:34,294 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 23:56:34,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 23:56:34,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 23:56:34,295 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 23:56:34,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 23:56:34,296 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 23:56:34,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 23:56:34,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 23:56:34,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 23:56:34,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 23:56:34,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 23:56:34,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 23:56:34,297 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 23:56:34,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 23:56:34,297 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 23:56:34,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 23:56:34,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 23:56:34,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 23:56:34,298 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 23:56:34,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:56:34,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 23:56:34,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 23:56:34,299 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 23:56:34,299 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 23:56:34,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 23:56:34,299 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 23:56:34,299 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 23:56:34,300 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 23:56:34,300 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 23:56:34,300 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2021-12-15 23:56:34,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 23:56:34,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 23:56:34,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 23:56:34,521 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 23:56:34,521 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 23:56:34,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2021-12-15 23:56:34,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c52953109/089ee6f0120045be9f2c76a088ef1137/FLAG49280c552 [2021-12-15 23:56:34,995 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 23:56:34,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2021-12-15 23:56:35,007 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c52953109/089ee6f0120045be9f2c76a088ef1137/FLAG49280c552 [2021-12-15 23:56:35,358 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c52953109/089ee6f0120045be9f2c76a088ef1137 [2021-12-15 23:56:35,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 23:56:35,361 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 23:56:35,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 23:56:35,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 23:56:35,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 23:56:35,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:56:35" (1/1) ... [2021-12-15 23:56:35,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d7cf3e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:35, skipping insertion in model container [2021-12-15 23:56:35,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:56:35" (1/1) ... [2021-12-15 23:56:35,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 23:56:35,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 23:56:35,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2021-12-15 23:56:35,648 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:56:35,653 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 23:56:35,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2021-12-15 23:56:35,702 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:56:35,719 INFO L208 MainTranslator]: Completed translation [2021-12-15 23:56:35,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:35 WrapperNode [2021-12-15 23:56:35,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 23:56:35,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 23:56:35,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 23:56:35,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 23:56:35,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:35" (1/1) ... [2021-12-15 23:56:35,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:35" (1/1) ... [2021-12-15 23:56:35,753 INFO L137 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2021-12-15 23:56:35,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 23:56:35,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 23:56:35,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 23:56:35,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 23:56:35,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:35" (1/1) ... [2021-12-15 23:56:35,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:35" (1/1) ... [2021-12-15 23:56:35,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:35" (1/1) ... [2021-12-15 23:56:35,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:35" (1/1) ... [2021-12-15 23:56:35,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:35" (1/1) ... [2021-12-15 23:56:35,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:35" (1/1) ... [2021-12-15 23:56:35,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:35" (1/1) ... [2021-12-15 23:56:35,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 23:56:35,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 23:56:35,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 23:56:35,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 23:56:35,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:35" (1/1) ... [2021-12-15 23:56:35,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:56:35,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:35,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 23:56:35,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 23:56:35,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 23:56:35,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 23:56:35,831 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-15 23:56:35,831 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-15 23:56:35,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 23:56:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 23:56:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 23:56:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 23:56:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 23:56:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 23:56:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-15 23:56:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 23:56:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 23:56:35,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 23:56:35,933 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 23:56:35,934 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 23:56:36,149 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 23:56:36,153 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 23:56:36,153 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-15 23:56:36,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:56:36 BoogieIcfgContainer [2021-12-15 23:56:36,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 23:56:36,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 23:56:36,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 23:56:36,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 23:56:36,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:56:35" (1/3) ... [2021-12-15 23:56:36,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58af8446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:56:36, skipping insertion in model container [2021-12-15 23:56:36,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:35" (2/3) ... [2021-12-15 23:56:36,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58af8446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:56:36, skipping insertion in model container [2021-12-15 23:56:36,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:56:36" (3/3) ... [2021-12-15 23:56:36,162 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2021-12-15 23:56:36,167 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 23:56:36,167 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 23:56:36,208 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 23:56:36,215 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 23:56:36,215 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 23:56:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:56:36,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 23:56:36,243 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:36,243 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:36,244 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:36,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:36,248 INFO L85 PathProgramCache]: Analyzing trace with hash 308507763, now seen corresponding path program 1 times [2021-12-15 23:56:36,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:36,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716773914] [2021-12-15 23:56:36,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:36,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:36,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-15 23:56:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:36,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:36,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:36,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716773914] [2021-12-15 23:56:36,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716773914] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:36,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:56:36,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:56:36,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662945173] [2021-12-15 23:56:36,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:36,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:56:36,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:36,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:56:36,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:56:36,468 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-15 23:56:36,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:36,525 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2021-12-15 23:56:36,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:56:36,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-15 23:56:36,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:36,534 INFO L225 Difference]: With dead ends: 57 [2021-12-15 23:56:36,534 INFO L226 Difference]: Without dead ends: 26 [2021-12-15 23:56:36,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:56:36,539 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:36,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-15 23:56:36,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-15 23:56:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:56:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-12-15 23:56:36,579 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2021-12-15 23:56:36,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:36,579 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-15 23:56:36,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-15 23:56:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2021-12-15 23:56:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 23:56:36,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:36,582 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:36,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 23:56:36,582 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:36,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2109805219, now seen corresponding path program 1 times [2021-12-15 23:56:36,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:36,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845891638] [2021-12-15 23:56:36,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:36,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:36,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-15 23:56:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:36,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:36,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845891638] [2021-12-15 23:56:36,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845891638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:36,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:56:36,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:56:36,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619995665] [2021-12-15 23:56:36,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:36,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:56:36,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:36,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:56:36,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:56:36,690 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-15 23:56:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:36,734 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2021-12-15 23:56:36,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:56:36,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-15 23:56:36,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:36,735 INFO L225 Difference]: With dead ends: 50 [2021-12-15 23:56:36,736 INFO L226 Difference]: Without dead ends: 31 [2021-12-15 23:56:36,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:56:36,738 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:36,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 70 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:36,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-15 23:56:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2021-12-15 23:56:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:56:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-12-15 23:56:36,746 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2021-12-15 23:56:36,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:36,747 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-12-15 23:56:36,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-15 23:56:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2021-12-15 23:56:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 23:56:36,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:36,749 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:36,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 23:56:36,749 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:36,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:36,750 INFO L85 PathProgramCache]: Analyzing trace with hash 493100305, now seen corresponding path program 1 times [2021-12-15 23:56:36,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:36,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367543057] [2021-12-15 23:56:36,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:36,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:56:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:36,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-15 23:56:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:56:36,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:36,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367543057] [2021-12-15 23:56:36,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367543057] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:36,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:56:36,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:56:36,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921149781] [2021-12-15 23:56:36,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:36,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:56:36,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:36,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:56:36,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:56:36,852 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:56:36,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:36,896 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2021-12-15 23:56:36,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:56:36,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2021-12-15 23:56:36,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:36,897 INFO L225 Difference]: With dead ends: 55 [2021-12-15 23:56:36,897 INFO L226 Difference]: Without dead ends: 31 [2021-12-15 23:56:36,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:56:36,902 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:36,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-15 23:56:36,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-12-15 23:56:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:56:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-12-15 23:56:36,911 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2021-12-15 23:56:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:36,911 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-15 23:56:36,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:56:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2021-12-15 23:56:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 23:56:36,913 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:36,913 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:36,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 23:56:36,913 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:36,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:36,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247597, now seen corresponding path program 1 times [2021-12-15 23:56:36,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:36,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543918994] [2021-12-15 23:56:36,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:36,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:36,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:56:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:36,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-15 23:56:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:56:36,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:36,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543918994] [2021-12-15 23:56:36,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543918994] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:36,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853380077] [2021-12-15 23:56:36,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:36,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:36,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:36,995 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:56:36,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 23:56:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:37,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 23:56:37,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:37,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:56:37,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853380077] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:56:37,204 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:56:37,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2021-12-15 23:56:37,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967477860] [2021-12-15 23:56:37,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:56:37,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 23:56:37,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:37,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 23:56:37,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:56:37,206 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-15 23:56:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:37,238 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2021-12-15 23:56:37,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 23:56:37,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2021-12-15 23:56:37,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:37,239 INFO L225 Difference]: With dead ends: 51 [2021-12-15 23:56:37,239 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 23:56:37,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:56:37,240 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:37,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 23:56:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-15 23:56:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:56:37,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2021-12-15 23:56:37,244 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2021-12-15 23:56:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:37,244 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-12-15 23:56:37,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-15 23:56:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2021-12-15 23:56:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 23:56:37,245 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:37,245 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:37,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 23:56:37,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:37,463 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:37,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:37,464 INFO L85 PathProgramCache]: Analyzing trace with hash -292922041, now seen corresponding path program 1 times [2021-12-15 23:56:37,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:37,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364226171] [2021-12-15 23:56:37,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:37,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:37,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:56:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:37,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-15 23:56:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:37,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-15 23:56:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 23:56:37,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:37,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364226171] [2021-12-15 23:56:37,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364226171] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:37,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:56:37,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-15 23:56:37,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491583926] [2021-12-15 23:56:37,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:37,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 23:56:37,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:37,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 23:56:37,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-15 23:56:37,630 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:56:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:37,726 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-12-15 23:56:37,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 23:56:37,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-12-15 23:56:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:37,727 INFO L225 Difference]: With dead ends: 45 [2021-12-15 23:56:37,727 INFO L226 Difference]: Without dead ends: 42 [2021-12-15 23:56:37,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-12-15 23:56:37,728 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 61 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:37,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 132 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 23:56:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-15 23:56:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2021-12-15 23:56:37,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:56:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-12-15 23:56:37,732 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 37 [2021-12-15 23:56:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:37,732 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-12-15 23:56:37,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:56:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2021-12-15 23:56:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 23:56:37,733 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:37,733 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:37,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 23:56:37,733 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:37,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:37,734 INFO L85 PathProgramCache]: Analyzing trace with hash -292920367, now seen corresponding path program 1 times [2021-12-15 23:56:37,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:37,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694636419] [2021-12-15 23:56:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:37,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:37,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:56:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:37,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-15 23:56:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:37,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-15 23:56:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:56:37,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:37,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694636419] [2021-12-15 23:56:37,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694636419] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:37,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182394321] [2021-12-15 23:56:37,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:37,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:37,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:37,952 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:56:37,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 23:56:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:38,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-15 23:56:38,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:38,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-15 23:56:38,385 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_652 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_652))))) is different from true [2021-12-15 23:56:38,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:38,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-12-15 23:56:38,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-15 23:56:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-12-15 23:56:38,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:38,545 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int)) (|v_node_create_~temp~0#1.base_13| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_13| v_ArrVal_655) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (<= |c_#StackHeapBarrier| |v_node_create_~temp~0#1.base_13|) (<= 1 .cse0) (<= (+ .cse0 1) 0)))) is different from false [2021-12-15 23:56:38,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182394321] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:38,546 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:56:38,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2021-12-15 23:56:38,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137133488] [2021-12-15 23:56:38,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:56:38,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-15 23:56:38,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:38,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-15 23:56:38,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=525, Unknown=2, NotChecked=94, Total=702 [2021-12-15 23:56:38,548 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 23:56:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:38,858 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2021-12-15 23:56:38,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 23:56:38,859 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2021-12-15 23:56:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:38,860 INFO L225 Difference]: With dead ends: 39 [2021-12-15 23:56:38,860 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 23:56:38,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=856, Unknown=2, NotChecked=122, Total=1122 [2021-12-15 23:56:38,861 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:38,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 214 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 261 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2021-12-15 23:56:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 23:56:38,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-15 23:56:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:56:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2021-12-15 23:56:38,866 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2021-12-15 23:56:38,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:38,866 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-15 23:56:38,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 23:56:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-12-15 23:56:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 23:56:38,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:38,867 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:38,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 23:56:39,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-15 23:56:39,085 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:39,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:39,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1499731437, now seen corresponding path program 1 times [2021-12-15 23:56:39,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:39,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256095980] [2021-12-15 23:56:39,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:39,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:39,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:56:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:39,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-15 23:56:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:39,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-15 23:56:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:56:39,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:39,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256095980] [2021-12-15 23:56:39,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256095980] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:39,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459305689] [2021-12-15 23:56:39,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:39,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:39,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:39,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:56:39,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 23:56:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:39,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-15 23:56:39,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:39,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-15 23:56:39,855 WARN L860 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_892 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_892)))) is different from true [2021-12-15 23:56:39,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:39,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-15 23:56:40,004 INFO L354 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2021-12-15 23:56:40,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2021-12-15 23:56:40,024 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-15 23:56:40,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 42 [2021-12-15 23:56:40,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2021-12-15 23:56:40,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-15 23:56:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-12-15 23:56:40,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:40,315 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| Int) (v_ArrVal_900 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_893 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_900))) (let ((.cse1 (select .cse0 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse2 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= 0 (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_16|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= 0 (select .cse1 .cse2))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16|))))) is different from false [2021-12-15 23:56:40,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459305689] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:40,317 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:56:40,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2021-12-15 23:56:40,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240840623] [2021-12-15 23:56:40,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:56:40,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-15 23:56:40,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:40,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-15 23:56:40,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1091, Unknown=3, NotChecked=134, Total=1332 [2021-12-15 23:56:40,319 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 32 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-15 23:56:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:40,802 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2021-12-15 23:56:40,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 23:56:40,802 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2021-12-15 23:56:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:40,803 INFO L225 Difference]: With dead ends: 52 [2021-12-15 23:56:40,803 INFO L226 Difference]: Without dead ends: 49 [2021-12-15 23:56:40,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=2138, Unknown=3, NotChecked=190, Total=2550 [2021-12-15 23:56:40,804 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 62 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:40,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 238 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 436 Invalid, 0 Unknown, 38 Unchecked, 0.2s Time] [2021-12-15 23:56:40,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-15 23:56:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2021-12-15 23:56:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:56:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2021-12-15 23:56:40,812 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 40 [2021-12-15 23:56:40,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:40,812 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2021-12-15 23:56:40,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-15 23:56:40,813 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2021-12-15 23:56:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 23:56:40,813 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:40,814 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:40,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 23:56:41,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:41,014 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:41,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:41,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1499729763, now seen corresponding path program 1 times [2021-12-15 23:56:41,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:41,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307636423] [2021-12-15 23:56:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:41,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:41,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:56:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:41,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-15 23:56:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:41,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-15 23:56:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:56:41,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:41,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307636423] [2021-12-15 23:56:41,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307636423] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:41,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947314200] [2021-12-15 23:56:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:41,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:41,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:41,737 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:56:41,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 23:56:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:42,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 92 conjunts are in the unsatisfiable core [2021-12-15 23:56:42,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:42,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:56:42,424 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 23:56:42,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 23:56:42,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:56:42,548 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:56:42,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-15 23:56:42,794 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:42,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 22 [2021-12-15 23:56:42,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 23:56:43,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:43,015 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 23:56:43,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 49 [2021-12-15 23:56:43,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:43,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 23:56:43,033 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-15 23:56:43,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-15 23:56:43,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 23:56:43,149 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:43,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 15 [2021-12-15 23:56:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:43,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:43,304 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_19| Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1148 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_node_create_~temp~0#1.base_19|))) (not (= 0 (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_1149))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_19| v_ArrVal_1148) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (<= |c_#StackHeapBarrier| |v_node_create_~temp~0#1.base_19|))) is different from false [2021-12-15 23:56:43,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947314200] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:43,306 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:56:43,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 46 [2021-12-15 23:56:43,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640487983] [2021-12-15 23:56:43,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:56:43,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-15 23:56:43,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:43,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-15 23:56:43,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2123, Unknown=7, NotChecked=92, Total=2352 [2021-12-15 23:56:43,308 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 46 states, 44 states have (on average 1.5) internal successors, (66), 38 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 23:56:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:45,069 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2021-12-15 23:56:45,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 23:56:45,070 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.5) internal successors, (66), 38 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2021-12-15 23:56:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:45,071 INFO L225 Difference]: With dead ends: 62 [2021-12-15 23:56:45,071 INFO L226 Difference]: Without dead ends: 37 [2021-12-15 23:56:45,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=289, Invalid=3613, Unknown=8, NotChecked=122, Total=4032 [2021-12-15 23:56:45,073 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:45,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 396 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 546 Invalid, 0 Unknown, 45 Unchecked, 0.3s Time] [2021-12-15 23:56:45,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-15 23:56:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2021-12-15 23:56:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:56:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2021-12-15 23:56:45,082 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 40 [2021-12-15 23:56:45,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:45,083 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2021-12-15 23:56:45,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.5) internal successors, (66), 38 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 23:56:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2021-12-15 23:56:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 23:56:45,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:45,085 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:45,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 23:56:45,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:45,299 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:45,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1422189688, now seen corresponding path program 1 times [2021-12-15 23:56:45,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:45,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933159983] [2021-12-15 23:56:45,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:45,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:45,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:56:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:45,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-15 23:56:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:45,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-15 23:56:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:56:46,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:46,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933159983] [2021-12-15 23:56:46,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933159983] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:46,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997069733] [2021-12-15 23:56:46,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:46,202 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:46,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:46,204 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:56:46,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 23:56:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:46,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 142 conjunts are in the unsatisfiable core [2021-12-15 23:56:46,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:46,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:56:46,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:56:46,955 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 23:56:46,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 23:56:47,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:56:47,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:47,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-15 23:56:47,124 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:56:47,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-15 23:56:47,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-15 23:56:47,490 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:47,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 32 [2021-12-15 23:56:47,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:56:47,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 23:56:47,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 23:56:47,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:47,692 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 23:56:47,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 65 [2021-12-15 23:56:47,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:47,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 23:56:47,711 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-15 23:56:47,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-15 23:56:47,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:47,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 23:56:48,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:56:48,415 INFO L354 Elim1Store]: treesize reduction 152, result has 16.0 percent of original size [2021-12-15 23:56:48,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 199 treesize of output 106 [2021-12-15 23:56:48,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:48,431 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 23:56:48,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 107 [2021-12-15 23:56:48,448 INFO L354 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2021-12-15 23:56:48,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2021-12-15 23:56:48,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2021-12-15 23:56:48,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:48,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 23:56:48,570 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:48,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 27 [2021-12-15 23:56:48,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 23:56:48,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 23:56:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:48,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:48,700 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1402 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (= (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_1407) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1406) (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_1403)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1409) |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_1402)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1405) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-15 23:56:48,997 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_12| Int) (v_ArrVal_1402 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (let ((.cse0 (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 ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_12| 4))) (or (= (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1407) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1406) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 v_ArrVal_1403)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1409) |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_1402)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1405) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select .cse1 .cse2) 0)))))) is different from false [2021-12-15 23:56:49,031 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_12| Int) (v_ArrVal_1402 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_12| 4))) (or (not (= (select .cse0 .cse1) 0)) (= (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_1407) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1406) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 v_ArrVal_1403)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1409) |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_1402)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1405) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2021-12-15 23:56:49,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_23| Int) (v_ArrVal_1420 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_12| Int) (v_ArrVal_1402 Int) (v_ArrVal_1403 Int) (v_ArrVal_1409 (Array Int Int)) (v_ArrVal_1419 (Array Int Int)) (v_ArrVal_1418 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23| v_ArrVal_1420)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23| v_ArrVal_1419))) (let ((.cse2 (select (select .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse0 (select .cse3 .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_12| 4))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23|))) (not (= (select .cse0 .cse1) 0)) (= (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23| v_ArrVal_1418) .cse2 v_ArrVal_1407) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23| v_ArrVal_1406) (select (select (store (store .cse3 .cse2 (store .cse0 .cse1 v_ArrVal_1403)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23| v_ArrVal_1409) |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_1402)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23| v_ArrVal_1405) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_23|)))))) is different from false [2021-12-15 23:56:49,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997069733] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:49,236 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:56:49,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 52 [2021-12-15 23:56:49,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869292955] [2021-12-15 23:56:49,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:56:49,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-15 23:56:49,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:49,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-15 23:56:49,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2802, Unknown=6, NotChecked=436, Total=3422 [2021-12-15 23:56:49,239 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 52 states, 50 states have (on average 1.38) internal successors, (69), 43 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 23:56:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:51,114 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2021-12-15 23:56:51,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-15 23:56:51,114 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.38) internal successors, (69), 43 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2021-12-15 23:56:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:51,115 INFO L225 Difference]: With dead ends: 49 [2021-12-15 23:56:51,115 INFO L226 Difference]: Without dead ends: 47 [2021-12-15 23:56:51,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=387, Invalid=4879, Unknown=6, NotChecked=580, Total=5852 [2021-12-15 23:56:51,116 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 102 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:51,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 258 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 762 Invalid, 0 Unknown, 4 Unchecked, 0.4s Time] [2021-12-15 23:56:51,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-15 23:56:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2021-12-15 23:56:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:56:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2021-12-15 23:56:51,120 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 42 [2021-12-15 23:56:51,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:51,121 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2021-12-15 23:56:51,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.38) internal successors, (69), 43 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 23:56:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2021-12-15 23:56:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-15 23:56:51,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:51,121 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:51,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-15 23:56:51,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:51,331 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:51,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash 924723017, now seen corresponding path program 1 times [2021-12-15 23:56:51,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:51,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121424539] [2021-12-15 23:56:51,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:51,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:51,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:56:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:51,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-15 23:56:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:51,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-15 23:56:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:51,966 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:56:51,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:51,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121424539] [2021-12-15 23:56:51,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121424539] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:51,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946444455] [2021-12-15 23:56:51,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:51,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:51,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:51,968 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:56:51,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 23:56:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:52,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 92 conjunts are in the unsatisfiable core [2021-12-15 23:56:52,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:52,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:56:52,480 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 23:56:52,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 23:56:52,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:56:52,671 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:56:52,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-15 23:56:52,976 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 23:56:52,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2021-12-15 23:56:53,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 23:56:53,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:56:53,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:53,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 23:56:53,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:53,171 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 23:56:53,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 62 [2021-12-15 23:56:53,184 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-15 23:56:53,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-15 23:56:53,525 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-15 23:56:53,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-12-15 23:56:53,564 INFO L354 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2021-12-15 23:56:53,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 61 [2021-12-15 23:56:53,587 INFO L354 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2021-12-15 23:56:53,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 111 [2021-12-15 23:56:53,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:53,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 23:56:53,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2021-12-15 23:56:53,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 23:56:53,729 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 23:56:53,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2021-12-15 23:56:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 23:56:53,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:54,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946444455] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:54,177 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:56:54,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 49 [2021-12-15 23:56:54,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130164793] [2021-12-15 23:56:54,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:56:54,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-15 23:56:54,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:54,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-15 23:56:54,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2872, Unknown=14, NotChecked=0, Total=3080 [2021-12-15 23:56:54,181 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 49 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 40 states have internal predecessors, (70), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-15 23:56:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:55,862 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2021-12-15 23:56:55,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-15 23:56:55,862 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 40 states have internal predecessors, (70), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2021-12-15 23:56:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:55,863 INFO L225 Difference]: With dead ends: 49 [2021-12-15 23:56:55,863 INFO L226 Difference]: Without dead ends: 46 [2021-12-15 23:56:55,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=449, Invalid=5389, Unknown=14, NotChecked=0, Total=5852 [2021-12-15 23:56:55,865 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 52 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:55,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 418 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 734 Invalid, 0 Unknown, 6 Unchecked, 0.4s Time] [2021-12-15 23:56:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-15 23:56:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2021-12-15 23:56:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:56:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2021-12-15 23:56:55,870 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 44 [2021-12-15 23:56:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:55,871 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2021-12-15 23:56:55,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 40 states have internal predecessors, (70), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-15 23:56:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2021-12-15 23:56:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-15 23:56:55,871 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:55,872 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:55,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-15 23:56:56,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:56,089 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:56,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:56,090 INFO L85 PathProgramCache]: Analyzing trace with hash 924724691, now seen corresponding path program 1 times [2021-12-15 23:56:56,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:56,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264703340] [2021-12-15 23:56:56,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:56,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:56,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:56:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:57,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-15 23:56:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:57,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-15 23:56:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:56:57,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:57,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264703340] [2021-12-15 23:56:57,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264703340] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:57,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381677159] [2021-12-15 23:56:57,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:57,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:57,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:57,438 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:56:57,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-15 23:56:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:57,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 158 conjunts are in the unsatisfiable core [2021-12-15 23:56:57,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:57,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:56:58,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:58,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-15 23:56:58,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 23:56:58,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 23:56:58,424 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 23:56:58,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-15 23:56:58,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 23:56:58,446 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 23:56:58,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 23:56:58,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:56:58,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 23:56:58,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:56:58,666 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:56:58,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 90 [2021-12-15 23:56:58,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2021-12-15 23:56:58,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-15 23:56:59,086 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:59,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 43 [2021-12-15 23:56:59,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:56:59,096 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:59,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 23:56:59,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 23:56:59,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:59,309 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 23:56:59,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 80 [2021-12-15 23:56:59,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:59,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-15 23:56:59,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:59,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:59,322 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 23:56:59,323 INFO L388 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 [2021-12-15 23:56:59,335 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-15 23:56:59,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-15 23:57:00,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:00,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:57:00,127 INFO L354 Elim1Store]: treesize reduction 153, result has 15.5 percent of original size [2021-12-15 23:57:00,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 268 treesize of output 136 [2021-12-15 23:57:00,156 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-15 23:57:00,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 332 treesize of output 205 [2021-12-15 23:57:00,184 INFO L354 Elim1Store]: treesize reduction 140, result has 13.6 percent of original size [2021-12-15 23:57:00,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 205 [2021-12-15 23:57:00,203 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-12-15 23:57:00,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 217 treesize of output 201 [2021-12-15 23:57:00,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:57:00,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:00,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2021-12-15 23:57:00,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2021-12-15 23:57:00,529 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:57:00,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:00,533 INFO L354 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2021-12-15 23:57:00,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 89 [2021-12-15 23:57:00,538 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 23:57:00,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 15 [2021-12-15 23:57:00,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 23:57:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:57:00,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:57:00,674 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1943 Int) (v_ArrVal_1944 Int) (v_ArrVal_1946 (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_1944)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1945)) (.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_1940))) (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_1943)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1946) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-15 23:57:00,936 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1943 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_17| Int) (v_ArrVal_1944 Int) (v_ArrVal_1946 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse3)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| 4))) (or (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (not (= 0 (select .cse1 .cse2))) (= (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse2 v_ArrVal_1944)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1945)) (.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 (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_1940))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse3 (store (select |c_#memory_int| .cse3) .cse2 v_ArrVal_1943)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1946) (select (select .cse4 .cse5) .cse6)) (select (select .cse7 .cse5) .cse6)))) |c_ULTIMATE.start_main_~data~0#1|)))))) is different from false [2021-12-15 23:57:00,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1943 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_17| Int) (v_ArrVal_1944 Int) (v_ArrVal_1946 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| 4))) (or (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)) (= (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 v_ArrVal_1944)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1945)) (.cse4 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse8 .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1940))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select .cse7 |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) .cse3 v_ArrVal_1943)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1946) (select (select .cse4 .cse5) .cse6)) (select (select .cse7 .cse5) .cse6)))) |c_ULTIMATE.start_main_~data~0#1|) (not (= 0 (select .cse8 .cse3)))))))) is different from false [2021-12-15 23:57:01,216 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1940 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| Int) (v_ArrVal_1943 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_17| Int) (v_ArrVal_1957 (Array Int Int)) (v_ArrVal_1944 Int) (v_ArrVal_1946 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1956)) (.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1957))) (let ((.cse1 (select (select .cse10 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select .cse10 .cse1) .cse2))) (let ((.cse11 (select .cse10 .cse4)) (.cse5 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| 4))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31|))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31|) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (select (select .cse0 .cse1) .cse2)) (= (let ((.cse9 (store (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_ArrVal_1944)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1945)) (.cse6 (store (store .cse10 .cse4 (store .cse11 .cse5 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1940))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse3 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1955))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_1943))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1946) (select (select .cse6 .cse7) .cse8)) (select (select .cse9 .cse7) .cse8)))) |c_ULTIMATE.start_main_~data~0#1|) (not (= 0 (select .cse11 .cse5))))))))) is different from false [2021-12-15 23:57:01,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381677159] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:57:01,218 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:57:01,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2021-12-15 23:57:01,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145468662] [2021-12-15 23:57:01,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:57:01,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-12-15 23:57:01,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:57:01,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-12-15 23:57:01,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=3586, Unknown=5, NotChecked=492, Total=4290 [2021-12-15 23:57:01,220 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 58 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 49 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 23:57:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:57:03,357 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2021-12-15 23:57:03,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-15 23:57:03,357 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 49 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2021-12-15 23:57:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:57:03,358 INFO L225 Difference]: With dead ends: 48 [2021-12-15 23:57:03,358 INFO L226 Difference]: Without dead ends: 46 [2021-12-15 23:57:03,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=401, Invalid=6090, Unknown=5, NotChecked=644, Total=7140 [2021-12-15 23:57:03,367 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 41 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 23:57:03,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 327 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 812 Invalid, 0 Unknown, 70 Unchecked, 0.5s Time] [2021-12-15 23:57:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-15 23:57:03,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2021-12-15 23:57:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:57:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2021-12-15 23:57:03,378 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 44 [2021-12-15 23:57:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:57:03,379 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2021-12-15 23:57:03,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 49 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 23:57:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2021-12-15 23:57:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-15 23:57:03,379 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:57:03,379 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:57:03,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-15 23:57:03,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:57:03,599 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:57:03,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:57:03,599 INFO L85 PathProgramCache]: Analyzing trace with hash 478170515, now seen corresponding path program 2 times [2021-12-15 23:57:03,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:57:03,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776520129] [2021-12-15 23:57:03,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:03,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:57:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:04,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:57:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:04,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-15 23:57:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:04,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-15 23:57:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:57:04,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:57:04,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776520129] [2021-12-15 23:57:04,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776520129] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:57:04,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927384800] [2021-12-15 23:57:04,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 23:57:04,911 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:57:04,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:57:04,912 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:57:04,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-15 23:57:05,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 23:57:05,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 23:57:05,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 206 conjunts are in the unsatisfiable core [2021-12-15 23:57:05,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:57:05,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:57:05,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 23:57:05,348 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:57:05,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-15 23:57:05,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:57:05,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:57:05,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 23:57:05,609 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 23:57:05,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:57:05,785 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 23:57:05,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-15 23:57:05,838 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-12-15 23:57:05,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-12-15 23:57:05,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 23:57:05,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2021-12-15 23:57:05,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 23:57:05,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:05,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-15 23:57:05,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2021-12-15 23:57:05,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 23:57:06,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:06,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:57:06,132 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 23:57:06,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 59 [2021-12-15 23:57:06,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:06,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2021-12-15 23:57:06,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:06,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-15 23:57:06,561 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 23:57:06,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 53 [2021-12-15 23:57:06,584 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 23:57:06,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2021-12-15 23:57:06,590 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:57:06,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-15 23:57:06,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2021-12-15 23:57:06,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:06,842 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-15 23:57:06,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 89 [2021-12-15 23:57:06,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:06,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 23:57:06,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:06,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:06,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:06,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:06,855 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 23:57:06,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 48 [2021-12-15 23:57:06,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:06,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:06,882 INFO L354 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2021-12-15 23:57:06,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2021-12-15 23:57:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:57:07,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:57:07,414 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2230 Int) (v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2223 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2223))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_2230))) (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|) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2234) |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|) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2227) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-15 23:57:08,650 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:57:08,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 80 [2021-12-15 23:57:09,710 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2230 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.base_20| Int) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2227 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| Int) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2245 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_21| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| v_ArrVal_2247)) (.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| v_ArrVal_2245))) (let ((.cse8 (select .cse2 |v_ULTIMATE.start_dll_append_~last~0#1.base_20|)) (.cse0 (select .cse5 |v_ULTIMATE.start_dll_append_~last~0#1.base_20|)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_21| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select v_arrayElimArr_12 0) |c_ULTIMATE.start_dll_append_~data#1|)) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (+ (select (select .cse5 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (and (= (select (select .cse2 .cse3) .cse4) 0) (= (select (select .cse5 .cse3) .cse4) 0)))) (not (= 0 (select .cse8 .cse1))) (= (select (select (let ((.cse9 (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| v_arrayElimArr_12) |v_ULTIMATE.start_dll_append_~last~0#1.base_20| v_ArrVal_2223))) (store .cse9 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| (store (select .cse9 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35|) 8 v_ArrVal_2230))) (select (select (store (store .cse2 |v_ULTIMATE.start_dll_append_~last~0#1.base_20| (store .cse8 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| v_ArrVal_2234) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse5 |v_ULTIMATE.start_dll_append_~last~0#1.base_20| (store .cse0 .cse1 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| v_ArrVal_2227) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35|))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35|))))) is different from false [2021-12-15 23:57:09,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927384800] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:57:09,713 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:57:09,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 54 [2021-12-15 23:57:09,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394279262] [2021-12-15 23:57:09,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:57:09,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-12-15 23:57:09,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:57:09,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-15 23:57:09,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3578, Unknown=8, NotChecked=242, Total=4032 [2021-12-15 23:57:09,714 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 54 states, 52 states have (on average 1.4230769230769231) 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) [2021-12-15 23:57:11,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:57:11,366 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2021-12-15 23:57:11,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-15 23:57:11,366 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.4230769230769231) 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 [2021-12-15 23:57:11,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:57:11,367 INFO L225 Difference]: With dead ends: 83 [2021-12-15 23:57:11,367 INFO L226 Difference]: Without dead ends: 71 [2021-12-15 23:57:11,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=365, Invalid=5641, Unknown=8, NotChecked=306, Total=6320 [2021-12-15 23:57:11,369 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 55 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-15 23:57:11,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 281 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 819 Invalid, 0 Unknown, 33 Unchecked, 0.6s Time] [2021-12-15 23:57:11,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-15 23:57:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2021-12-15 23:57:11,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-15 23:57:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2021-12-15 23:57:11,378 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 44 [2021-12-15 23:57:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:57:11,378 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2021-12-15 23:57:11,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.4230769230769231) 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) [2021-12-15 23:57:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2021-12-15 23:57:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-15 23:57:11,383 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:57:11,383 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:57:11,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-15 23:57:11,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-15 23:57:11,586 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:57:11,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:57:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash -397769244, now seen corresponding path program 2 times [2021-12-15 23:57:11,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:57:11,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355974981] [2021-12-15 23:57:11,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:11,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:57:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:12,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:57:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:12,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-15 23:57:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:12,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-15 23:57:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:57:12,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:57:12,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355974981] [2021-12-15 23:57:12,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355974981] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:57:12,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350798249] [2021-12-15 23:57:12,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 23:57:12,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:57:12,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:57:12,412 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:57:12,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-15 23:57:12,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 23:57:12,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 23:57:12,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 129 conjunts are in the unsatisfiable core [2021-12-15 23:57:12,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:57:12,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:57:12,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 23:57:12,761 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 23:57:12,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 23:57:12,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:57:13,014 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: line 666099 column 46: unknown constant v_#valid_BEFORE_CALL_26 [2021-12-15 23:57:13,014 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-15 23:57:13,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2021-12-15 23:57:13,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371302693] [2021-12-15 23:57:13,015 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-15 23:57:13,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-15 23:57:13,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:57:13,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-15 23:57:13,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1101, Unknown=0, NotChecked=0, Total=1190 [2021-12-15 23:57:13,016 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 28 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 24 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:57:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 23:57:13,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=1101, Unknown=0, NotChecked=0, Total=1190 [2021-12-15 23:57:13,017 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:57:13,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:57:13,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-15 23:57:13,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-15 23:57:13,239 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@511de2d3 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 23:57:13,242 INFO L158 Benchmark]: Toolchain (without parser) took 37880.47ms. Allocated memory was 125.8MB in the beginning and 406.8MB in the end (delta: 281.0MB). Free memory was 101.2MB in the beginning and 362.8MB in the end (delta: -261.7MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2021-12-15 23:57:13,242 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory was 83.2MB in the beginning and 83.1MB in the end (delta: 64.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 23:57:13,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.66ms. Allocated memory is still 125.8MB. Free memory was 101.2MB in the beginning and 93.6MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 23:57:13,242 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.50ms. Allocated memory is still 125.8MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 23:57:13,242 INFO L158 Benchmark]: Boogie Preprocessor took 19.08ms. Allocated memory is still 125.8MB. Free memory was 91.5MB in the beginning and 89.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 23:57:13,242 INFO L158 Benchmark]: RCFGBuilder took 381.30ms. Allocated memory is still 125.8MB. Free memory was 89.7MB in the beginning and 75.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-15 23:57:13,243 INFO L158 Benchmark]: TraceAbstraction took 37084.88ms. Allocated memory was 125.8MB in the beginning and 406.8MB in the end (delta: 281.0MB). Free memory was 75.0MB in the beginning and 362.8MB in the end (delta: -287.8MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 23:57:13,244 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.16ms. Allocated memory is still 125.8MB. Free memory was 83.2MB in the beginning and 83.1MB in the end (delta: 64.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.66ms. Allocated memory is still 125.8MB. Free memory was 101.2MB in the beginning and 93.6MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.50ms. Allocated memory is still 125.8MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.08ms. Allocated memory is still 125.8MB. Free memory was 91.5MB in the beginning and 89.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 381.30ms. Allocated memory is still 125.8MB. Free memory was 89.7MB in the beginning and 75.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 37084.88ms. Allocated memory was 125.8MB in the beginning and 406.8MB in the end (delta: 281.0MB). Free memory was 75.0MB in the beginning and 362.8MB in the end (delta: -287.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@511de2d3 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@511de2d3: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 23:57:13,265 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-tmp.no-commuhash-c3fed41 [2021-12-15 23:57:15,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 23:57:15,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 23:57:15,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 23:57:15,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 23:57:15,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 23:57:15,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 23:57:15,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 23:57:15,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 23:57:15,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 23:57:15,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 23:57:15,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 23:57:15,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 23:57:15,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 23:57:15,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 23:57:15,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 23:57:15,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 23:57:15,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 23:57:15,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 23:57:15,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 23:57:15,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 23:57:15,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 23:57:15,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 23:57:15,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 23:57:15,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 23:57:15,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 23:57:15,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 23:57:15,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 23:57:15,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 23:57:15,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 23:57:15,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 23:57:15,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 23:57:15,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 23:57:15,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 23:57:15,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 23:57:15,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 23:57:15,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 23:57:15,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 23:57:15,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 23:57:15,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 23:57:15,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 23:57:15,117 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-15 23:57:15,144 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 23:57:15,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 23:57:15,145 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 23:57:15,145 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 23:57:15,145 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 23:57:15,146 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 23:57:15,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 23:57:15,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 23:57:15,147 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 23:57:15,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 23:57:15,148 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 23:57:15,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 23:57:15,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 23:57:15,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 23:57:15,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 23:57:15,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 23:57:15,154 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 23:57:15,154 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-15 23:57:15,154 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-15 23:57:15,155 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 23:57:15,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 23:57:15,155 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 23:57:15,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 23:57:15,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 23:57:15,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 23:57:15,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 23:57:15,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:57:15,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 23:57:15,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 23:57:15,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 23:57:15,157 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-15 23:57:15,157 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-15 23:57:15,157 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 23:57:15,157 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 23:57:15,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 23:57:15,158 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 23:57:15,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-15 23:57:15,158 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 [2021-12-15 23:57:15,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 23:57:15,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 23:57:15,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 23:57:15,467 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 23:57:15,467 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 23:57:15,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2021-12-15 23:57:15,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cbb1239/5bcc24334bb8482db17711de7a8bd040/FLAG9f160fc7f [2021-12-15 23:57:15,916 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 23:57:15,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2021-12-15 23:57:15,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cbb1239/5bcc24334bb8482db17711de7a8bd040/FLAG9f160fc7f [2021-12-15 23:57:15,941 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cbb1239/5bcc24334bb8482db17711de7a8bd040 [2021-12-15 23:57:15,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 23:57:15,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 23:57:15,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 23:57:15,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 23:57:15,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 23:57:15,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:57:15" (1/1) ... [2021-12-15 23:57:15,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42979b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:15, skipping insertion in model container [2021-12-15 23:57:15,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:57:15" (1/1) ... [2021-12-15 23:57:15,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 23:57:15,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 23:57:16,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2021-12-15 23:57:16,248 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:57:16,264 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 23:57:16,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2021-12-15 23:57:16,311 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:57:16,335 INFO L208 MainTranslator]: Completed translation [2021-12-15 23:57:16,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:16 WrapperNode [2021-12-15 23:57:16,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 23:57:16,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 23:57:16,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 23:57:16,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 23:57:16,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:16" (1/1) ... [2021-12-15 23:57:16,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:16" (1/1) ... [2021-12-15 23:57:16,370 INFO L137 Inliner]: procedures = 130, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 123 [2021-12-15 23:57:16,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 23:57:16,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 23:57:16,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 23:57:16,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 23:57:16,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:16" (1/1) ... [2021-12-15 23:57:16,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:16" (1/1) ... [2021-12-15 23:57:16,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:16" (1/1) ... [2021-12-15 23:57:16,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:16" (1/1) ... [2021-12-15 23:57:16,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:16" (1/1) ... [2021-12-15 23:57:16,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:16" (1/1) ... [2021-12-15 23:57:16,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:16" (1/1) ... [2021-12-15 23:57:16,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 23:57:16,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 23:57:16,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 23:57:16,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 23:57:16,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:16" (1/1) ... [2021-12-15 23:57:16,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:57:16,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:57:16,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 23:57:16,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 23:57:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-15 23:57:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-15 23:57:16,492 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-15 23:57:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 23:57:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 23:57:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 23:57:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 23:57:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 23:57:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 23:57:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-15 23:57:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-15 23:57:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-15 23:57:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 23:57:16,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 23:57:16,591 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 23:57:16,592 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 23:57:16,849 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 23:57:16,853 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 23:57:16,853 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-15 23:57:16,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:57:16 BoogieIcfgContainer [2021-12-15 23:57:16,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 23:57:16,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 23:57:16,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 23:57:16,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 23:57:16,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:57:15" (1/3) ... [2021-12-15 23:57:16,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136f8ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:57:16, skipping insertion in model container [2021-12-15 23:57:16,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:16" (2/3) ... [2021-12-15 23:57:16,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136f8ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:57:16, skipping insertion in model container [2021-12-15 23:57:16,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:57:16" (3/3) ... [2021-12-15 23:57:16,864 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2021-12-15 23:57:16,867 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 23:57:16,868 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 23:57:16,901 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 23:57:16,906 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 23:57:16,906 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 23:57:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:57:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 23:57:16,920 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:57:16,921 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:57:16,922 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:57:16,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:57:16,925 INFO L85 PathProgramCache]: Analyzing trace with hash 308507763, now seen corresponding path program 1 times [2021-12-15 23:57:16,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:57:16,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543471359] [2021-12-15 23:57:16,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:16,934 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:57:16,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:57:16,936 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 23:57:16,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-15 23:57:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:17,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-15 23:57:17,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:57:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:57:17,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:57:17,094 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:57:17,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543471359] [2021-12-15 23:57:17,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543471359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:57:17,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:57:17,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 23:57:17,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137423673] [2021-12-15 23:57:17,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:57:17,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 23:57:17,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:57:17,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 23:57:17,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 23:57:17,121 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) [2021-12-15 23:57:17,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:57:17,139 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2021-12-15 23:57:17,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 23:57:17,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-15 23:57:17,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:57:17,144 INFO L225 Difference]: With dead ends: 57 [2021-12-15 23:57:17,144 INFO L226 Difference]: Without dead ends: 26 [2021-12-15 23:57:17,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 23:57:17,148 INFO L933 BasicCegarLoop]: 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 [2021-12-15 23:57:17,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:57:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-15 23:57:17,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-15 23:57:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:57:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-12-15 23:57:17,170 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2021-12-15 23:57:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:57:17,170 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-15 23:57:17,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-15 23:57:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2021-12-15 23:57:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 23:57:17,172 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:57:17,172 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:57:17,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-15 23:57:17,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 23:57:17,381 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:57:17,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:57:17,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2109805219, now seen corresponding path program 1 times [2021-12-15 23:57:17,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:57:17,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553246156] [2021-12-15 23:57:17,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:17,382 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:57:17,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:57:17,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 23:57:17,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-15 23:57:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:17,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 23:57:17,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:57:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:57:17,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:57:17,490 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:57:17,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553246156] [2021-12-15 23:57:17,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553246156] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:57:17,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:57:17,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:57:17,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321097230] [2021-12-15 23:57:17,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:57:17,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:57:17,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:57:17,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:57:17,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:57:17,495 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) [2021-12-15 23:57:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:57:17,508 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2021-12-15 23:57:17,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:57:17,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-15 23:57:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:57:17,512 INFO L225 Difference]: With dead ends: 50 [2021-12-15 23:57:17,512 INFO L226 Difference]: Without dead ends: 31 [2021-12-15 23:57:17,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:57:17,514 INFO L933 BasicCegarLoop]: 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 [2021-12-15 23:57:17,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:57:17,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-15 23:57:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2021-12-15 23:57:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:57:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-12-15 23:57:17,522 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2021-12-15 23:57:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:57:17,522 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-12-15 23:57:17,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-15 23:57:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2021-12-15 23:57:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 23:57:17,524 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:57:17,524 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:57:17,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-15 23:57:17,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 23:57:17,732 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:57:17,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:57:17,733 INFO L85 PathProgramCache]: Analyzing trace with hash 493100305, now seen corresponding path program 1 times [2021-12-15 23:57:17,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:57:17,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959483339] [2021-12-15 23:57:17,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:17,734 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:57:17,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:57:17,736 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 23:57:17,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-15 23:57:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:17,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 23:57:17,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:57:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:57:18,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:57:18,011 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:57:18,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959483339] [2021-12-15 23:57:18,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959483339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:57:18,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:57:18,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:57:18,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586525607] [2021-12-15 23:57:18,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:57:18,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:57:18,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:57:18,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:57:18,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:57:18,013 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) [2021-12-15 23:57:18,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:57:18,042 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2021-12-15 23:57:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:57:18,043 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 [2021-12-15 23:57:18,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:57:18,044 INFO L225 Difference]: With dead ends: 55 [2021-12-15 23:57:18,044 INFO L226 Difference]: Without dead ends: 31 [2021-12-15 23:57:18,044 INFO L932 BasicCegarLoop]: 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 [2021-12-15 23:57:18,045 INFO L933 BasicCegarLoop]: 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 [2021-12-15 23:57:18,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:57:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-15 23:57:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-12-15 23:57:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:57:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-12-15 23:57:18,049 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2021-12-15 23:57:18,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:57:18,049 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-15 23:57:18,049 INFO L471 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) [2021-12-15 23:57:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2021-12-15 23:57:18,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 23:57:18,050 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:57:18,050 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:57:18,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-15 23:57:18,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 23:57:18,259 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:57:18,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:57:18,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247597, now seen corresponding path program 1 times [2021-12-15 23:57:18,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:57:18,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251959435] [2021-12-15 23:57:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:18,260 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:57:18,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:57:18,261 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 23:57:18,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-15 23:57:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:18,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 23:57:18,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:57:18,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:57:18,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:57:18,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:57:18,457 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:57:18,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251959435] [2021-12-15 23:57:18,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251959435] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:57:18,457 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:57:18,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-15 23:57:18,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618154602] [2021-12-15 23:57:18,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:57:18,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 23:57:18,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:57:18,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 23:57:18,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:57:18,459 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) [2021-12-15 23:57:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:57:18,485 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2021-12-15 23:57:18,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 23:57:18,485 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 [2021-12-15 23:57:18,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:57:18,486 INFO L225 Difference]: With dead ends: 55 [2021-12-15 23:57:18,486 INFO L226 Difference]: Without dead ends: 36 [2021-12-15 23:57:18,486 INFO L932 BasicCegarLoop]: 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 [2021-12-15 23:57:18,487 INFO L933 BasicCegarLoop]: 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 [2021-12-15 23:57:18,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 144 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:57:18,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-15 23:57:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2021-12-15 23:57:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:57:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2021-12-15 23:57:18,491 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2021-12-15 23:57:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:57:18,491 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-12-15 23:57:18,492 INFO L471 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) [2021-12-15 23:57:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2021-12-15 23:57:18,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 23:57:18,492 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:57:18,493 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:57:18,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-15 23:57:18,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 23:57:18,701 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:57:18,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:57:18,702 INFO L85 PathProgramCache]: Analyzing trace with hash -292922041, now seen corresponding path program 1 times [2021-12-15 23:57:18,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:57:18,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925538962] [2021-12-15 23:57:18,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:18,703 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:57:18,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:57:18,704 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) [2021-12-15 23:57:18,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-15 23:57:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:18,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 23:57:18,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:57:19,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:57:19,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-15 23:57:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 23:57:19,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:57:19,048 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:57:19,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925538962] [2021-12-15 23:57:19,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925538962] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:57:19,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:57:19,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 23:57:19,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262860142] [2021-12-15 23:57:19,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:57:19,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 23:57:19,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:57:19,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 23:57:19,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-15 23:57:19,049 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) [2021-12-15 23:57:19,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:57:19,287 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-12-15 23:57:19,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 23:57:19,288 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 [2021-12-15 23:57:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:57:19,289 INFO L225 Difference]: With dead ends: 45 [2021-12-15 23:57:19,289 INFO L226 Difference]: Without dead ends: 42 [2021-12-15 23:57:19,289 INFO L932 BasicCegarLoop]: 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 [2021-12-15 23:57:19,290 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 23:57:19,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 150 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 23:57:19,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-15 23:57:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2021-12-15 23:57:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:57:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-12-15 23:57:19,294 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 37 [2021-12-15 23:57:19,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:57:19,294 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-12-15 23:57:19,294 INFO L471 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) [2021-12-15 23:57:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2021-12-15 23:57:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 23:57:19,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:57:19,295 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:57:19,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-15 23:57:19,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 23:57:19,508 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:57:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:57:19,508 INFO L85 PathProgramCache]: Analyzing trace with hash -292920367, now seen corresponding path program 1 times [2021-12-15 23:57:19,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:57:19,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177997921] [2021-12-15 23:57:19,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:19,509 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:57:19,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:57:19,510 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 23:57:19,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-15 23:57:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:19,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-15 23:57:19,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:57:19,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:57:19,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-15 23:57:19,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:19,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-15 23:57:20,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-15 23:57:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:57:20,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:57:20,159 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:57:20,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177997921] [2021-12-15 23:57:20,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177997921] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:57:20,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [756392762] [2021-12-15 23:57:20,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:20,159 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-15 23:57:20,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-15 23:57:20,161 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-15 23:57:20,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-12-15 23:57:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:20,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 23:57:20,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:57:20,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-15 23:57:20,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:20,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-15 23:57:20,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-15 23:57:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:57:20,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:57:20,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [756392762] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:57:20,989 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:57:20,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2021-12-15 23:57:20,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785842733] [2021-12-15 23:57:20,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:57:20,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-15 23:57:20,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:57:20,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-15 23:57:20,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=502, Unknown=8, NotChecked=0, Total=600 [2021-12-15 23:57:20,990 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) [2021-12-15 23:57:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:57:21,485 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2021-12-15 23:57:21,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 23:57:21,486 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 [2021-12-15 23:57:21,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:57:21,486 INFO L225 Difference]: With dead ends: 39 [2021-12-15 23:57:21,486 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 23:57:21,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=721, Unknown=9, NotChecked=0, Total=870 [2021-12-15 23:57:21,487 INFO L933 BasicCegarLoop]: 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 [2021-12-15 23:57:21,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 211 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 52 Unchecked, 0.4s Time] [2021-12-15 23:57:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 23:57:21,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-15 23:57:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:57:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2021-12-15 23:57:21,490 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2021-12-15 23:57:21,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:57:21,490 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-15 23:57:21,491 INFO L471 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) [2021-12-15 23:57:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-12-15 23:57:21,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 23:57:21,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:57:21,491 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:57:21,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2021-12-15 23:57:21,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-15 23:57:21,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 23:57:21,895 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:57:21,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:57:21,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1499731437, now seen corresponding path program 1 times [2021-12-15 23:57:21,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:57:21,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374262374] [2021-12-15 23:57:21,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:21,896 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:57:21,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:57:21,897 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 23:57:21,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-15 23:57:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:22,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-15 23:57:22,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:57:22,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:57:22,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-15 23:57:22,578 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (and (bvult v_arrayElimCell_8 |c_#StackHeapBarrier|) (not (= (_ bv0 32) v_arrayElimCell_8)))) (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))) (not (= (_ bv0 32) (bvadd |c_#StackHeapBarrier| (_ bv1 32)))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2021-12-15 23:57:22,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:22,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-12-15 23:57:23,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:23,070 INFO L354 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2021-12-15 23:57:23,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 36 [2021-12-15 23:57:23,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-12-15 23:57:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2021-12-15 23:57:23,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:57:23,281 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_517) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-15 23:57:23,296 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |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|) v_ArrVal_517) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-15 23:57:23,303 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |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|) v_ArrVal_517) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-15 23:57:23,425 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:57:23,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374262374] [2021-12-15 23:57:23,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374262374] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:57:23,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [106053501] [2021-12-15 23:57:23,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:23,426 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-15 23:57:23,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-15 23:57:23,427 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-15 23:57:23,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-12-15 23:57:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:23,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-15 23:57:23,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:57:24,467 INFO L354 Elim1Store]: treesize reduction 39, result has 37.1 percent of original size [2021-12-15 23:57:24,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 70 [2021-12-15 23:57:24,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:24,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2021-12-15 23:57:24,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:24,511 INFO L354 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2021-12-15 23:57:24,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2021-12-15 23:57:24,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-15 23:57:24,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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 [2021-12-15 23:57:24,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-15 23:57:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 23:57:24,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:57:24,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [106053501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:57:24,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 23:57:24,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [19] total 30 [2021-12-15 23:57:24,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550164727] [2021-12-15 23:57:24,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:57:24,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 23:57:24,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:57:24,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 23:57:24,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=885, Unknown=10, NotChecked=252, Total=1260 [2021-12-15 23:57:24,687 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) [2021-12-15 23:57:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:57:24,849 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2021-12-15 23:57:24,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 23:57:24,850 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 [2021-12-15 23:57:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:57:24,850 INFO L225 Difference]: With dead ends: 42 [2021-12-15 23:57:24,850 INFO L226 Difference]: Without dead ends: 39 [2021-12-15 23:57:24,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=1003, Unknown=10, NotChecked=268, Total=1406 [2021-12-15 23:57:24,851 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:57:24,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 112 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2021-12-15 23:57:24,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-15 23:57:24,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2021-12-15 23:57:24,854 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) [2021-12-15 23:57:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2021-12-15 23:57:24,855 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 40 [2021-12-15 23:57:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:57:24,855 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2021-12-15 23:57:24,855 INFO L471 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) [2021-12-15 23:57:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2021-12-15 23:57:24,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 23:57:24,855 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:57:24,855 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:57:24,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-15 23:57:25,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2021-12-15 23:57:25,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-15 23:57:25,270 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:57:25,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:57:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1499729763, now seen corresponding path program 1 times [2021-12-15 23:57:25,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:57:25,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947077640] [2021-12-15 23:57:25,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:25,271 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:57:25,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:57:25,273 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 23:57:25,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-15 23:57:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:25,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-15 23:57:25,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:57:25,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:57:25,773 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-15 23:57:25,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-15 23:57:25,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:57:25,890 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:57:25,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 57 [2021-12-15 23:57:25,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-15 23:57:26,139 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-15 23:57:26,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 38 [2021-12-15 23:57:26,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 23:57:26,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-15 23:57:26,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:26,371 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 23:57:26,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 56 [2021-12-15 23:57:26,394 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-15 23:57:26,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2021-12-15 23:57:26,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:26,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 23:57:26,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 23:57:26,710 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-15 23:57:26,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2021-12-15 23:57:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:57:26,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:57:27,050 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:57:27,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947077640] [2021-12-15 23:57:27,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947077640] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:57:27,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1411256617] [2021-12-15 23:57:27,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:27,051 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-15 23:57:27,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-15 23:57:27,052 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-15 23:57:27,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2021-12-15 23:57:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:27,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-15 23:57:27,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:57:27,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:57:27,768 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-15 23:57:27,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-15 23:57:27,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:57:27,974 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:57:27,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2021-12-15 23:57:28,338 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:57:28,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 29 [2021-12-15 23:57:28,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 23:57:28,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:28,471 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 23:57:28,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 56 [2021-12-15 23:57:28,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:28,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 23:57:28,532 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-15 23:57:28,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2021-12-15 23:57:28,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 23:57:28,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:28,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:57:28,864 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:57:28,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 26 [2021-12-15 23:57:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:57:28,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:57:29,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1411256617] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:57:29,106 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:57:29,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 37 [2021-12-15 23:57:29,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478428200] [2021-12-15 23:57:29,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:57:29,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-15 23:57:29,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:57:29,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-15 23:57:29,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1394, Unknown=6, NotChecked=0, Total=1560 [2021-12-15 23:57:29,107 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 37 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 30 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 23:57:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:57:29,994 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2021-12-15 23:57:29,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 23:57:29,994 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 30 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2021-12-15 23:57:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:57:29,996 INFO L225 Difference]: With dead ends: 64 [2021-12-15 23:57:29,996 INFO L226 Difference]: Without dead ends: 35 [2021-12-15 23:57:29,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=259, Invalid=1990, Unknown=7, NotChecked=0, Total=2256 [2021-12-15 23:57:29,997 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 23:57:29,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 240 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 166 Invalid, 0 Unknown, 90 Unchecked, 0.4s Time] [2021-12-15 23:57:29,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-15 23:57:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-12-15 23:57:30,000 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) [2021-12-15 23:57:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-12-15 23:57:30,001 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 40 [2021-12-15 23:57:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:57:30,001 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-12-15 23:57:30,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 30 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 23:57:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-12-15 23:57:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 23:57:30,001 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:57:30,001 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:57:30,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-15 23:57:30,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2021-12-15 23:57:30,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-15 23:57:30,422 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:57:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:57:30,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1422188014, now seen corresponding path program 1 times [2021-12-15 23:57:30,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:57:30,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630759295] [2021-12-15 23:57:30,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:30,422 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:57:30,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:57:30,423 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 23:57:30,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-15 23:57:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:30,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-15 23:57:30,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:57:30,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:57:30,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-15 23:57:30,768 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-15 23:57:30,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-15 23:57:30,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-15 23:57:31,055 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-15 23:57:31,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 46 [2021-12-15 23:57:31,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:57:31,210 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:57:31,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 57 [2021-12-15 23:57:31,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-15 23:57:31,535 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 23:57:31,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 37 [2021-12-15 23:57:31,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 23:57:31,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-12-15 23:57:31,754 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 23:57:31,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-15 23:57:31,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 23:57:31,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:31,783 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 23:57:31,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 68 [2021-12-15 23:57:31,809 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-15 23:57:31,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 49 [2021-12-15 23:57:32,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 23:57:32,400 INFO L354 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2021-12-15 23:57:32,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 60 [2021-12-15 23:57:32,440 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-15 23:57:32,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 91 [2021-12-15 23:57:32,578 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-12-15 23:57:32,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 37 [2021-12-15 23:57:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 23:57:32,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:57:32,728 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_945 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (not (= (_ bv0 32) (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 |ULTIMATE.start_dll_append_~last~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_945) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-15 23:57:32,743 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_13| (_ BitVec 32)) (v_ArrVal_945 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_dll_append_~last~0#1.offset| (_ bv4 32))))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_13| (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_945) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-15 23:57:32,757 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_13| (_ BitVec 32)) (v_ArrVal_945 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (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))))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_13| (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_945) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-15 23:57:32,766 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_13| (_ BitVec 32)) (v_ArrVal_945 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (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))))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_13| (_ bv4 32)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_945) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-15 23:57:32,958 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:57:32,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630759295] [2021-12-15 23:57:32,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630759295] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:57:32,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1609196883] [2021-12-15 23:57:32,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:32,958 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-15 23:57:32,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-15 23:57:32,959 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-15 23:57:32,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2021-12-15 23:57:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:33,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-15 23:57:33,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:57:34,168 INFO L354 Elim1Store]: treesize reduction 58, result has 37.6 percent of original size [2021-12-15 23:57:34,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 85 [2021-12-15 23:57:34,213 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-15 23:57:34,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 48 [2021-12-15 23:57:34,294 INFO L354 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2021-12-15 23:57:34,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 99 [2021-12-15 23:57:34,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:57:34,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-15 23:57:37,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 61 [2021-12-15 23:57:37,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-12-15 23:57:37,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-12-15 23:57:38,146 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:57:38,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 174 treesize of output 224 [2021-12-15 23:57:38,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 215 [2021-12-15 23:57:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 23:57:40,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:57:40,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (or (forall ((v_ArrVal_1050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1052 (_ 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 |ULTIMATE.start_dll_append_~last~0#1.offset| (_ bv4 32)) v_ArrVal_1052)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_1049 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (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 |ULTIMATE.start_dll_append_~last~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2021-12-15 23:57:40,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (_ BitVec 32)) (v_ArrVal_1049 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1052 (_ BitVec 32)) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd |ULTIMATE.start_dll_append_~last~0#1.offset| (_ bv4 32)))) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_17| (_ bv4 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_1052)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (_ bv0 32) (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_1049) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false