./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 22:18:19,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 22:18:19,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 22:18:19,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 22:18:19,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 22:18:19,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 22:18:19,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 22:18:19,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 22:18:19,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 22:18:19,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 22:18:19,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 22:18:19,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 22:18:19,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 22:18:19,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 22:18:19,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 22:18:19,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 22:18:19,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 22:18:19,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 22:18:19,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 22:18:19,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 22:18:19,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 22:18:19,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 22:18:19,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 22:18:19,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 22:18:19,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 22:18:19,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 22:18:19,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 22:18:19,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 22:18:19,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 22:18:19,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 22:18:19,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 22:18:19,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 22:18:19,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 22:18:19,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 22:18:19,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 22:18:19,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 22:18:19,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 22:18:19,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 22:18:19,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 22:18:19,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 22:18:19,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 22:18:19,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 22:18:19,444 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 22:18:19,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 22:18:19,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 22:18:19,448 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 22:18:19,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 22:18:19,449 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 22:18:19,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 22:18:19,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 22:18:19,450 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 22:18:19,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 22:18:19,451 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 22:18:19,452 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 22:18:19,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 22:18:19,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 22:18:19,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 22:18:19,452 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 22:18:19,452 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 22:18:19,453 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 22:18:19,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 22:18:19,453 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 22:18:19,453 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 22:18:19,453 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 22:18:19,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 22:18:19,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 22:18:19,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 22:18:19,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:18:19,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 22:18:19,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 22:18:19,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 22:18:19,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 22:18:19,456 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 22:18:19,456 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2021-12-18 22:18:19,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 22:18:19,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 22:18:19,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 22:18:19,732 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 22:18:19,733 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 22:18:19,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-12-18 22:18:19,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8794d70e/7d818455120f42aba6a2fb2b9895383e/FLAG8cd166f6b [2021-12-18 22:18:20,245 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 22:18:20,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-12-18 22:18:20,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8794d70e/7d818455120f42aba6a2fb2b9895383e/FLAG8cd166f6b [2021-12-18 22:18:20,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8794d70e/7d818455120f42aba6a2fb2b9895383e [2021-12-18 22:18:20,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 22:18:20,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 22:18:20,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 22:18:20,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 22:18:20,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 22:18:20,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:18:20" (1/1) ... [2021-12-18 22:18:20,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc06708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:18:20, skipping insertion in model container [2021-12-18 22:18:20,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:18:20" (1/1) ... [2021-12-18 22:18:20,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 22:18:20,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 22:18:20,981 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/sll2n_update_all_reverse.i[24236,24249] [2021-12-18 22:18:20,987 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:18:20,995 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 22:18:21,041 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/sll2n_update_all_reverse.i[24236,24249] [2021-12-18 22:18:21,042 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:18:21,066 INFO L208 MainTranslator]: Completed translation [2021-12-18 22:18:21,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:18:21 WrapperNode [2021-12-18 22:18:21,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 22:18:21,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 22:18:21,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 22:18:21,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 22:18:21,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:18:21" (1/1) ... [2021-12-18 22:18:21,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:18:21" (1/1) ... [2021-12-18 22:18:21,117 INFO L137 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2021-12-18 22:18:21,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 22:18:21,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 22:18:21,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 22:18:21,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 22:18:21,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:18:21" (1/1) ... [2021-12-18 22:18:21,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:18:21" (1/1) ... [2021-12-18 22:18:21,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:18:21" (1/1) ... [2021-12-18 22:18:21,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:18:21" (1/1) ... [2021-12-18 22:18:21,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:18:21" (1/1) ... [2021-12-18 22:18:21,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:18:21" (1/1) ... [2021-12-18 22:18:21,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:18:21" (1/1) ... [2021-12-18 22:18:21,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 22:18:21,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 22:18:21,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 22:18:21,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 22:18:21,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:18:21" (1/1) ... [2021-12-18 22:18:21,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:18:21,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:18:21,188 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-18 22:18:21,214 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-18 22:18:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 22:18:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 22:18:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 22:18:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 22:18:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 22:18:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 22:18:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 22:18:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 22:18:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 22:18:21,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 22:18:21,359 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 22:18:21,360 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 22:18:21,518 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 22:18:21,524 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 22:18:21,524 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-18 22:18:21,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:18:21 BoogieIcfgContainer [2021-12-18 22:18:21,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 22:18:21,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 22:18:21,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 22:18:21,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 22:18:21,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:18:20" (1/3) ... [2021-12-18 22:18:21,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b3934a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:18:21, skipping insertion in model container [2021-12-18 22:18:21,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:18:21" (2/3) ... [2021-12-18 22:18:21,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b3934a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:18:21, skipping insertion in model container [2021-12-18 22:18:21,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:18:21" (3/3) ... [2021-12-18 22:18:21,534 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2021-12-18 22:18:21,538 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 22:18:21,539 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-12-18 22:18:21,597 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 22:18:21,604 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-18 22:18:21,605 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-12-18 22:18:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-18 22:18:21,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:21,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-18 22:18:21,631 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:21,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:21,636 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2021-12-18 22:18:21,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:21,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426040417] [2021-12-18 22:18:21,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:21,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:21,782 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-18 22:18:21,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:21,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426040417] [2021-12-18 22:18:21,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426040417] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:18:21,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:18:21,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:18:21,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897070712] [2021-12-18 22:18:21,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:18:21,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:18:21,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:21,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:18:21,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:18:21,813 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:21,907 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2021-12-18 22:18:21,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:18:21,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-18 22:18:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:21,916 INFO L225 Difference]: With dead ends: 109 [2021-12-18 22:18:21,916 INFO L226 Difference]: Without dead ends: 104 [2021-12-18 22:18:21,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 22:18:21,920 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:21,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:18:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-18 22:18:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2021-12-18 22:18:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.6) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2021-12-18 22:18:21,952 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2021-12-18 22:18:21,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:21,953 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2021-12-18 22:18:21,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2021-12-18 22:18:21,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-18 22:18:21,954 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:21,954 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-18 22:18:21,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 22:18:21,955 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:21,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:21,956 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2021-12-18 22:18:21,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:21,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174045346] [2021-12-18 22:18:21,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:21,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:22,030 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-18 22:18:22,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:22,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174045346] [2021-12-18 22:18:22,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174045346] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:18:22,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:18:22,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:18:22,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197806488] [2021-12-18 22:18:22,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:18:22,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:18:22,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:22,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:18:22,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:18:22,034 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:22,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:22,100 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2021-12-18 22:18:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:18:22,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-18 22:18:22,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:22,102 INFO L225 Difference]: With dead ends: 102 [2021-12-18 22:18:22,103 INFO L226 Difference]: Without dead ends: 102 [2021-12-18 22:18:22,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 22:18:22,106 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:22,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:18:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-18 22:18:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2021-12-18 22:18:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.55) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-12-18 22:18:22,115 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2021-12-18 22:18:22,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:22,116 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-12-18 22:18:22,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-12-18 22:18:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-18 22:18:22,117 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:22,117 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:18:22,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 22:18:22,117 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:22,119 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2021-12-18 22:18:22,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:22,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287181719] [2021-12-18 22:18:22,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:22,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:22,151 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-18 22:18:22,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:22,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287181719] [2021-12-18 22:18:22,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287181719] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:18:22,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:18:22,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 22:18:22,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030060534] [2021-12-18 22:18:22,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:18:22,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:18:22,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:22,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:18:22,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:18:22,157 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:22,173 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2021-12-18 22:18:22,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:18:22,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-18 22:18:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:22,174 INFO L225 Difference]: With dead ends: 68 [2021-12-18 22:18:22,175 INFO L226 Difference]: Without dead ends: 68 [2021-12-18 22:18:22,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 22:18:22,176 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 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-18 22:18:22,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:18:22,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-18 22:18:22,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2021-12-18 22:18:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2021-12-18 22:18:22,186 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2021-12-18 22:18:22,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:22,187 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2021-12-18 22:18:22,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2021-12-18 22:18:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-18 22:18:22,188 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:22,188 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:18:22,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 22:18:22,189 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2021-12-18 22:18:22,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:22,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164790992] [2021-12-18 22:18:22,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:22,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:22,261 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-18 22:18:22,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:22,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164790992] [2021-12-18 22:18:22,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164790992] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:18:22,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:18:22,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 22:18:22,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808610454] [2021-12-18 22:18:22,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:18:22,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:18:22,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:22,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:18:22,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:18:22,266 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:22,355 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-12-18 22:18:22,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:18:22,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-18 22:18:22,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:22,357 INFO L225 Difference]: With dead ends: 76 [2021-12-18 22:18:22,357 INFO L226 Difference]: Without dead ends: 76 [2021-12-18 22:18:22,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:18:22,358 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 164 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:22,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:18:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-18 22:18:22,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2021-12-18 22:18:22,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-12-18 22:18:22,371 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2021-12-18 22:18:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:22,371 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-12-18 22:18:22,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-12-18 22:18:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-18 22:18:22,372 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:22,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:18:22,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 22:18:22,373 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:22,373 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2021-12-18 22:18:22,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:22,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553170800] [2021-12-18 22:18:22,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:22,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:22,449 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-18 22:18:22,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:22,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553170800] [2021-12-18 22:18:22,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553170800] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:18:22,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:18:22,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 22:18:22,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104140784] [2021-12-18 22:18:22,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:18:22,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:18:22,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:22,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:18:22,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:18:22,452 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:22,525 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2021-12-18 22:18:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:18:22,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-18 22:18:22,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:22,527 INFO L225 Difference]: With dead ends: 61 [2021-12-18 22:18:22,527 INFO L226 Difference]: Without dead ends: 61 [2021-12-18 22:18:22,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:18:22,528 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:22,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:18:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-18 22:18:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2021-12-18 22:18:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-12-18 22:18:22,533 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2021-12-18 22:18:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:22,533 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-12-18 22:18:22,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-12-18 22:18:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 22:18:22,534 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:22,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:18:22,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 22:18:22,535 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:22,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:22,535 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2021-12-18 22:18:22,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:22,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044477286] [2021-12-18 22:18:22,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:22,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:18:22,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:22,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044477286] [2021-12-18 22:18:22,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044477286] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:18:22,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793852120] [2021-12-18 22:18:22,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:22,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:18:22,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:18:22,587 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-18 22:18:22,615 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-18 22:18:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:22,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:18:22,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:18:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:18:22,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:18:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:18:22,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793852120] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:18:22,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:18:22,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-18 22:18:22,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560249547] [2021-12-18 22:18:22,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:18:22,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:18:22,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:22,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:18:22,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:18:22,829 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:22,849 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2021-12-18 22:18:22,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 22:18:22,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-18 22:18:22,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:22,851 INFO L225 Difference]: With dead ends: 65 [2021-12-18 22:18:22,852 INFO L226 Difference]: Without dead ends: 65 [2021-12-18 22:18:22,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:18:22,855 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:22,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 163 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:18:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-18 22:18:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-18 22:18:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.4) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2021-12-18 22:18:22,865 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2021-12-18 22:18:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:22,865 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2021-12-18 22:18:22,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:22,867 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2021-12-18 22:18:22,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 22:18:22,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:22,868 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:18:22,893 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-18 22:18:23,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-18 22:18:23,074 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:23,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2021-12-18 22:18:23,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:23,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657715073] [2021-12-18 22:18:23,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:23,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:18:23,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:23,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657715073] [2021-12-18 22:18:23,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657715073] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:18:23,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:18:23,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 22:18:23,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570099367] [2021-12-18 22:18:23,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:18:23,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:18:23,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:23,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:18:23,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:18:23,184 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:23,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:23,403 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2021-12-18 22:18:23,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:18:23,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 22:18:23,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:23,405 INFO L225 Difference]: With dead ends: 116 [2021-12-18 22:18:23,405 INFO L226 Difference]: Without dead ends: 116 [2021-12-18 22:18:23,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:18:23,407 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 379 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:23,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 141 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:18:23,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-18 22:18:23,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2021-12-18 22:18:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:23,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2021-12-18 22:18:23,412 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 26 [2021-12-18 22:18:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:23,412 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2021-12-18 22:18:23,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2021-12-18 22:18:23,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 22:18:23,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:23,413 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:18:23,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 22:18:23,414 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:23,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:23,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2021-12-18 22:18:23,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:23,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342947643] [2021-12-18 22:18:23,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:23,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 22:18:23,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:23,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342947643] [2021-12-18 22:18:23,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342947643] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:18:23,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:18:23,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 22:18:23,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497088610] [2021-12-18 22:18:23,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:18:23,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:18:23,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:23,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:18:23,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:18:23,482 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:23,515 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2021-12-18 22:18:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:18:23,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 22:18:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:23,517 INFO L225 Difference]: With dead ends: 96 [2021-12-18 22:18:23,517 INFO L226 Difference]: Without dead ends: 96 [2021-12-18 22:18:23,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:18:23,518 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 78 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:23,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 151 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:18:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-18 22:18:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-12-18 22:18:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 70 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2021-12-18 22:18:23,523 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 26 [2021-12-18 22:18:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:23,523 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2021-12-18 22:18:23,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2021-12-18 22:18:23,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 22:18:23,524 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:23,524 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:18:23,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 22:18:23,524 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:23,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:23,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913226, now seen corresponding path program 1 times [2021-12-18 22:18:23,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:23,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362329235] [2021-12-18 22:18:23,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:23,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:18:23,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:23,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362329235] [2021-12-18 22:18:23,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362329235] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:18:23,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:18:23,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 22:18:23,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692250800] [2021-12-18 22:18:23,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:18:23,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:18:23,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:23,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:18:23,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:18:23,640 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:23,878 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2021-12-18 22:18:23,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:18:23,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 22:18:23,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:23,880 INFO L225 Difference]: With dead ends: 107 [2021-12-18 22:18:23,880 INFO L226 Difference]: Without dead ends: 107 [2021-12-18 22:18:23,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:18:23,881 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 365 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:23,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 106 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:18:23,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-18 22:18:23,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2021-12-18 22:18:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.375) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2021-12-18 22:18:23,885 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 26 [2021-12-18 22:18:23,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:23,885 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2021-12-18 22:18:23,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2021-12-18 22:18:23,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-18 22:18:23,886 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:23,886 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:18:23,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 22:18:23,886 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:23,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:23,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2021-12-18 22:18:23,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:23,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111549861] [2021-12-18 22:18:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:23,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:18:24,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:24,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111549861] [2021-12-18 22:18:24,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111549861] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:18:24,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072288616] [2021-12-18 22:18:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:24,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:18:24,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:18:24,164 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-18 22:18:24,167 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-18 22:18:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:24,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-18 22:18:24,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:18:24,338 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 22:18:24,339 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-18 22:18:24,433 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 13 treesize of output 9 [2021-12-18 22:18:24,617 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 31 treesize of output 13 [2021-12-18 22:18:24,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:18:24,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:18:24,905 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 22:18:24,907 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 30 treesize of output 1 [2021-12-18 22:18:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:18:24,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072288616] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:18:24,917 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:18:24,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 11] total 31 [2021-12-18 22:18:24,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466139020] [2021-12-18 22:18:24,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:18:24,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-18 22:18:24,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:24,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-18 22:18:24,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2021-12-18 22:18:24,921 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:26,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:26,208 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2021-12-18 22:18:26,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-18 22:18:26,209 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-18 22:18:26,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:26,210 INFO L225 Difference]: With dead ends: 107 [2021-12-18 22:18:26,210 INFO L226 Difference]: Without dead ends: 107 [2021-12-18 22:18:26,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=518, Invalid=2238, Unknown=0, NotChecked=0, Total=2756 [2021-12-18 22:18:26,212 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 637 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:26,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 610 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 644 Invalid, 0 Unknown, 45 Unchecked, 0.4s Time] [2021-12-18 22:18:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-18 22:18:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 76. [2021-12-18 22:18:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2021-12-18 22:18:26,222 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 29 [2021-12-18 22:18:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:26,223 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2021-12-18 22:18:26,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2021-12-18 22:18:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-18 22:18:26,226 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:26,227 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:18:26,253 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-18 22:18:26,450 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,SelfDestructingSolverStorable9 [2021-12-18 22:18:26,450 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:26,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687585, now seen corresponding path program 1 times [2021-12-18 22:18:26,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:26,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706776969] [2021-12-18 22:18:26,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:26,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:18:26,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:26,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706776969] [2021-12-18 22:18:26,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706776969] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:18:26,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506774075] [2021-12-18 22:18:26,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:26,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:18:26,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:18:26,756 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-18 22:18:26,782 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-18 22:18:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:26,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-18 22:18:26,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:18:27,002 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:18:27,003 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 11 [2021-12-18 22:18:27,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 22:18:27,134 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 13 treesize of output 9 [2021-12-18 22:18:27,139 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-18 22:18:27,365 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 39 treesize of output 21 [2021-12-18 22:18:27,369 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 32 treesize of output 14 [2021-12-18 22:18:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:18:27,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:18:27,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:18:27,963 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 19 treesize of output 15 [2021-12-18 22:18:27,979 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 22:18:27,979 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 13 treesize of output 12 [2021-12-18 22:18:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:18:27,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506774075] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:18:27,996 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:18:27,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 41 [2021-12-18 22:18:27,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857829695] [2021-12-18 22:18:27,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:18:27,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-18 22:18:27,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:27,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-18 22:18:27,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1600, Unknown=0, NotChecked=0, Total=1722 [2021-12-18 22:18:27,998 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 42 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:30,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:30,584 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2021-12-18 22:18:30,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-18 22:18:30,585 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 42 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-18 22:18:30,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:30,586 INFO L225 Difference]: With dead ends: 213 [2021-12-18 22:18:30,586 INFO L226 Difference]: Without dead ends: 213 [2021-12-18 22:18:30,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=724, Invalid=3436, Unknown=0, NotChecked=0, Total=4160 [2021-12-18 22:18:30,588 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 3109 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3109 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:30,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3109 Valid, 720 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 929 Invalid, 0 Unknown, 62 Unchecked, 0.6s Time] [2021-12-18 22:18:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-18 22:18:30,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 84. [2021-12-18 22:18:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.391304347826087) internal successors, (96), 83 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2021-12-18 22:18:30,592 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 29 [2021-12-18 22:18:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:30,592 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2021-12-18 22:18:30,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 42 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2021-12-18 22:18:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-18 22:18:30,593 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:30,593 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:18:30,619 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-18 22:18:30,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:18:30,812 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:30,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:30,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1082686446, now seen corresponding path program 2 times [2021-12-18 22:18:30,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:30,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460537101] [2021-12-18 22:18:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:30,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 22:18:30,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:30,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460537101] [2021-12-18 22:18:30,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460537101] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:18:30,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:18:30,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 22:18:30,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152784761] [2021-12-18 22:18:30,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:18:30,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 22:18:30,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:30,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 22:18:30,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:18:30,896 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:30,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:30,921 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2021-12-18 22:18:30,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:18:30,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-18 22:18:30,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:30,922 INFO L225 Difference]: With dead ends: 70 [2021-12-18 22:18:30,922 INFO L226 Difference]: Without dead ends: 70 [2021-12-18 22:18:30,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:18:30,923 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 114 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:30,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 73 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:18:30,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-18 22:18:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-12-18 22:18:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.293103448275862) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2021-12-18 22:18:30,928 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 32 [2021-12-18 22:18:30,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:30,928 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2021-12-18 22:18:30,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2021-12-18 22:18:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 22:18:30,929 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:30,930 INFO L514 BasicCegarLoop]: trace histogram [2, 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-18 22:18:30,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 22:18:30,930 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:30,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:30,930 INFO L85 PathProgramCache]: Analyzing trace with hash -516260032, now seen corresponding path program 1 times [2021-12-18 22:18:30,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:30,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332046420] [2021-12-18 22:18:30,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:30,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:30,993 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-18 22:18:30,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:30,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332046420] [2021-12-18 22:18:30,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332046420] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:18:30,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:18:30,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 22:18:30,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693706281] [2021-12-18 22:18:30,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:18:30,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:18:30,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:30,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:18:30,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:18:30,995 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:31,147 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2021-12-18 22:18:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:18:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-18 22:18:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:31,148 INFO L225 Difference]: With dead ends: 89 [2021-12-18 22:18:31,148 INFO L226 Difference]: Without dead ends: 89 [2021-12-18 22:18:31,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:18:31,149 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 337 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:31,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 109 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:18:31,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-18 22:18:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2021-12-18 22:18:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 72 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2021-12-18 22:18:31,151 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 36 [2021-12-18 22:18:31,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:31,152 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2021-12-18 22:18:31,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2021-12-18 22:18:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 22:18:31,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:31,152 INFO L514 BasicCegarLoop]: trace histogram [2, 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-18 22:18:31,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 22:18:31,153 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:31,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:31,153 INFO L85 PathProgramCache]: Analyzing trace with hash -516260031, now seen corresponding path program 1 times [2021-12-18 22:18:31,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:31,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752261930] [2021-12-18 22:18:31,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:31,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 22:18:31,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:31,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752261930] [2021-12-18 22:18:31,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752261930] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:18:31,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719552503] [2021-12-18 22:18:31,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:31,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:18:31,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:18:31,224 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-18 22:18:31,233 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-18 22:18:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:31,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 22:18:31,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:18:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 22:18:31,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:18:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 22:18:31,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719552503] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:18:31,472 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:18:31,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-12-18 22:18:31,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100671914] [2021-12-18 22:18:31,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:18:31,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 22:18:31,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:31,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 22:18:31,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:18:31,474 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:31,495 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2021-12-18 22:18:31,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 22:18:31,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-18 22:18:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:31,497 INFO L225 Difference]: With dead ends: 95 [2021-12-18 22:18:31,497 INFO L226 Difference]: Without dead ends: 95 [2021-12-18 22:18:31,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:18:31,498 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 124 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:31,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:18:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-18 22:18:31,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2021-12-18 22:18:31,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 88 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2021-12-18 22:18:31,501 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 36 [2021-12-18 22:18:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:31,502 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2021-12-18 22:18:31,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2021-12-18 22:18:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 22:18:31,508 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:31,508 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:18:31,535 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-18 22:18:31,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:18:31,735 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:31,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:31,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1215669110, now seen corresponding path program 1 times [2021-12-18 22:18:31,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:31,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049456795] [2021-12-18 22:18:31,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:31,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 22:18:31,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:31,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049456795] [2021-12-18 22:18:31,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049456795] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:18:31,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136711365] [2021-12-18 22:18:31,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:31,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:18:31,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:18:31,800 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-18 22:18:31,801 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-18 22:18:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:31,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:18:31,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:18:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 22:18:31,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:18:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 22:18:32,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136711365] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:18:32,069 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:18:32,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-12-18 22:18:32,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234841192] [2021-12-18 22:18:32,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:18:32,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:18:32,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:32,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:18:32,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:18:32,071 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:32,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:32,103 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2021-12-18 22:18:32,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:18:32,104 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-18 22:18:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:32,104 INFO L225 Difference]: With dead ends: 90 [2021-12-18 22:18:32,105 INFO L226 Difference]: Without dead ends: 90 [2021-12-18 22:18:32,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:18:32,107 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 156 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:32,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 132 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:18:32,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-18 22:18:32,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2021-12-18 22:18:32,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.36986301369863) internal successors, (100), 83 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2021-12-18 22:18:32,111 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 37 [2021-12-18 22:18:32,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:32,111 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2021-12-18 22:18:32,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2021-12-18 22:18:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-18 22:18:32,112 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:32,112 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:18:32,135 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-18 22:18:32,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-18 22:18:32,328 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:32,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:32,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522149, now seen corresponding path program 2 times [2021-12-18 22:18:32,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:32,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405638671] [2021-12-18 22:18:32,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:32,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-18 22:18:32,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:32,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405638671] [2021-12-18 22:18:32,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405638671] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:18:32,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:18:32,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 22:18:32,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458050306] [2021-12-18 22:18:32,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:18:32,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:18:32,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:32,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:18:32,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:18:32,379 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:32,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:32,407 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2021-12-18 22:18:32,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:18:32,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-18 22:18:32,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:32,408 INFO L225 Difference]: With dead ends: 89 [2021-12-18 22:18:32,408 INFO L226 Difference]: Without dead ends: 89 [2021-12-18 22:18:32,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:18:32,409 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 61 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:32,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 136 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:18:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-18 22:18:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2021-12-18 22:18:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 82 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2021-12-18 22:18:32,411 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 41 [2021-12-18 22:18:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:32,412 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2021-12-18 22:18:32,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2021-12-18 22:18:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-18 22:18:32,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:32,413 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:18:32,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 22:18:32,413 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:32,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:32,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522204, now seen corresponding path program 1 times [2021-12-18 22:18:32,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:32,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366000964] [2021-12-18 22:18:32,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:32,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 22:18:32,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:32,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366000964] [2021-12-18 22:18:32,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366000964] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:18:32,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:18:32,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 22:18:32,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980545063] [2021-12-18 22:18:32,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:18:32,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:18:32,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:32,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:18:32,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:18:32,558 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:32,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:32,731 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2021-12-18 22:18:32,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:18:32,731 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-18 22:18:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:32,732 INFO L225 Difference]: With dead ends: 107 [2021-12-18 22:18:32,732 INFO L226 Difference]: Without dead ends: 107 [2021-12-18 22:18:32,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:18:32,733 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 413 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:32,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 80 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:18:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-18 22:18:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2021-12-18 22:18:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 82 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2021-12-18 22:18:32,735 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 41 [2021-12-18 22:18:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:32,736 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2021-12-18 22:18:32,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2021-12-18 22:18:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-18 22:18:32,737 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:32,737 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:18:32,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-18 22:18:32,737 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:32,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:32,738 INFO L85 PathProgramCache]: Analyzing trace with hash -333530929, now seen corresponding path program 1 times [2021-12-18 22:18:32,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:32,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631732701] [2021-12-18 22:18:32,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:32,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:18:33,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:33,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631732701] [2021-12-18 22:18:33,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631732701] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:18:33,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669773506] [2021-12-18 22:18:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:33,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:18:33,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:18:33,042 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-18 22:18:33,043 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-18 22:18:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:33,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-18 22:18:33,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:18:33,186 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:18:33,187 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 11 [2021-12-18 22:18:33,247 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 13 treesize of output 9 [2021-12-18 22:18:33,434 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:18:33,434 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 34 treesize of output 35 [2021-12-18 22:18:33,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:18:33,532 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 33 treesize of output 26 [2021-12-18 22:18:33,592 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 31 treesize of output 13 [2021-12-18 22:18:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:18:33,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:18:38,853 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-18 22:18:38,854 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 21 treesize of output 20 [2021-12-18 22:18:38,858 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2021-12-18 22:18:38,866 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2021-12-18 22:18:38,872 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_841) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2021-12-18 22:18:38,881 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_841) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2021-12-18 22:18:38,886 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_841) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))))) is different from false [2021-12-18 22:18:38,892 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_841) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))))) is different from false [2021-12-18 22:18:38,907 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_841) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))))) is different from false [2021-12-18 22:18:38,913 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:18:38,913 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-18 22:18:38,915 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 36 treesize of output 24 [2021-12-18 22:18:38,918 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 7 treesize of output 3 [2021-12-18 22:18:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2021-12-18 22:18:39,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669773506] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:18:39,012 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:18:39,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 46 [2021-12-18 22:18:39,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62895404] [2021-12-18 22:18:39,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:18:39,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-18 22:18:39,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:39,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-18 22:18:39,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1454, Unknown=8, NotChecked=574, Total=2162 [2021-12-18 22:18:39,014 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 47 states, 46 states have (on average 2.239130434782609) internal successors, (103), 47 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:18:40,564 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2021-12-18 22:18:40,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-18 22:18:40,565 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.239130434782609) internal successors, (103), 47 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-18 22:18:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:18:40,565 INFO L225 Difference]: With dead ends: 136 [2021-12-18 22:18:40,565 INFO L226 Difference]: Without dead ends: 136 [2021-12-18 22:18:40,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=627, Invalid=3553, Unknown=8, NotChecked=924, Total=5112 [2021-12-18 22:18:40,567 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 935 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 646 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 22:18:40,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [935 Valid, 767 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 996 Invalid, 0 Unknown, 646 Unchecked, 0.5s Time] [2021-12-18 22:18:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-18 22:18:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2021-12-18 22:18:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2021-12-18 22:18:40,569 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 44 [2021-12-18 22:18:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:18:40,570 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2021-12-18 22:18:40,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.239130434782609) internal successors, (103), 47 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:40,570 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2021-12-18 22:18:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-18 22:18:40,570 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:18:40,570 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:18:40,594 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-18 22:18:40,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-18 22:18:40,771 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:18:40,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:18:40,772 INFO L85 PathProgramCache]: Analyzing trace with hash -333530928, now seen corresponding path program 1 times [2021-12-18 22:18:40,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:18:40,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220679851] [2021-12-18 22:18:40,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:40,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:18:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:18:41,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:18:41,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220679851] [2021-12-18 22:18:41,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220679851] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:18:41,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819610570] [2021-12-18 22:18:41,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:18:41,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:18:41,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:18:41,253 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-18 22:18:41,255 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-18 22:18:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:18:41,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 83 conjunts are in the unsatisfiable core [2021-12-18 22:18:41,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:18:41,502 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:18:41,503 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 11 [2021-12-18 22:18:41,625 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-18 22:18:41,630 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 13 treesize of output 9 [2021-12-18 22:18:41,922 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:18:41,923 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 54 treesize of output 53 [2021-12-18 22:18:41,925 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 41 treesize of output 41 [2021-12-18 22:18:42,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:18:42,061 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 41 treesize of output 34 [2021-12-18 22:18:42,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:18:42,066 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 40 treesize of output 33 [2021-12-18 22:18:42,169 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 39 treesize of output 21 [2021-12-18 22:18:42,172 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 32 treesize of output 14 [2021-12-18 22:18:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:18:42,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:18:44,493 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_957 Int) (v_ArrVal_956 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) .cse0))))) (forall ((v_ArrVal_956 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) is different from false [2021-12-18 22:18:44,564 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:18:44,565 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 55 treesize of output 59 [2021-12-18 22:18:44,650 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_953) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) is different from false [2021-12-18 22:18:44,731 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_953) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) is different from false [2021-12-18 22:18:44,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_953) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1))))))) is different from false [2021-12-18 22:18:44,875 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse0)))) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_953) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) .cse2))))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))))))) is different from false [2021-12-18 22:18:44,917 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_953) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) .cse1))))) (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) v_ArrVal_952) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse2)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) v_ArrVal_952) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) is different from false [2021-12-18 22:18:44,949 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_953) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) .cse1))))) (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) v_ArrVal_952) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse2)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) v_ArrVal_952) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))))))) is different from false [2021-12-18 22:18:45,042 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) v_ArrVal_952) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse0)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) v_ArrVal_952) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_953) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) .cse3)))))))) is different from false [2021-12-18 22:18:45,056 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:18:45,056 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2021-12-18 22:18:45,060 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 101 treesize of output 95 [2021-12-18 22:18:45,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:18:45,067 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 89 treesize of output 77 [2021-12-18 22:18:45,072 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:18:45,073 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 77 [2021-12-18 22:18:45,076 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 94 treesize of output 90 [2021-12-18 22:18:45,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:18:45,080 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 87 treesize of output 79 [2021-12-18 22:18:45,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:18:45,087 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 51 treesize of output 47 [2021-12-18 22:18:45,089 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:18:45,091 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 44 treesize of output 40 [2021-12-18 22:18:45,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:18:45,095 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 37 treesize of output 33 [2021-12-18 22:18:45,332 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 22:18:45,333 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 13 treesize of output 12 [2021-12-18 22:18:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-18 22:18:45,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819610570] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:18:45,357 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:18:45,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 22] total 55 [2021-12-18 22:18:45,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678176355] [2021-12-18 22:18:45,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:18:45,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-12-18 22:18:45,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:18:45,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-12-18 22:18:45,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2108, Unknown=8, NotChecked=792, Total=3080 [2021-12-18 22:18:45,360 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 56 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 56 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:18:47,757 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5))) (and (= 1 (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|)) (<= (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 8) (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (<= 8 (select |c_#length| .cse0)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) v_ArrVal_952) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse1)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) v_ArrVal_952) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2)))) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4))) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_953) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) .cse4)))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_node_create_#res#1.base|))))) is different from false [2021-12-18 22:18:49,761 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_953) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) .cse1))))) (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) v_ArrVal_952) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse2)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) v_ArrVal_952) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |c_#length| .cse4)) (not (= .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) is different from false [2021-12-18 22:18:51,766 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_953) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) .cse1))))) (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) v_ArrVal_952) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse2)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) v_ArrVal_952) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 8 (select |c_#length| .cse4)) (not (= .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) is different from false [2021-12-18 22:18:53,795 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_953) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) .cse1))))) (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) v_ArrVal_952) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse2)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) v_ArrVal_952) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) (<= 8 (select |c_#length| .cse4)) (not (= .cse4 |c_ULTIMATE.start_sll_create_#res#1.base|)))) is different from false [2021-12-18 22:18:55,800 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (<= 8 (select |c_#length| .cse0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse1)))) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_953) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) .cse3))))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4))))))))) is different from false [2021-12-18 22:18:57,805 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (not (= (select .cse0 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_953) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2))))))) (<= 8 (select |c_#length| (select .cse0 4))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) 4) 0))) is different from false [2021-12-18 22:18:59,840 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse3 (select .cse2 .cse4)) (.cse0 (select .cse1 .cse4))) (and (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| .cse0) (<= 8 (select |c_#length| (select .cse1 4))) (= (select .cse2 4) 0) (not (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_953) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) (<= 0 .cse3) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|))))) is different from false [2021-12-18 22:19:01,896 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse4)) (.cse3 (select .cse1 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_953) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) (<= 8 (select |c_#length| (select .cse1 4))) (= (select .cse2 4) 0) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| .cse3) (<= 0 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= .cse3 |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))))) is different from false [2021-12-18 22:19:03,901 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5))) (and (= 1 (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|)) (<= (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 8) (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (<= 8 (select |c_#length| .cse0)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_prenex_2 Int)) (<= 0 (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) v_ArrVal_952) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse1)))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_956 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) v_ArrVal_952) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2)))) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4))) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_953) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) .cse4)))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_node_create_#res#1.base|))))) is different from false [2021-12-18 22:19:04,357 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse3 (select .cse2 .cse5)) (.cse4 (select .cse1 .cse5))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_957 Int) (v_ArrVal_956 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_957) .cse0))))) (forall ((v_ArrVal_956 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_956) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) (<= 8 (select |c_#length| (select .cse1 4))) (= (select .cse2 4) 0) (<= (+ .cse3 4) (select |c_#length| .cse4)) (<= 0 .cse3) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= .cse4 |c_ULTIMATE.start_main_~s~0#1.base|))))) is different from false [2021-12-18 22:19:04,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:19:04,899 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2021-12-18 22:19:04,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-18 22:19:04,900 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 56 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-18 22:19:04,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:19:04,900 INFO L225 Difference]: With dead ends: 151 [2021-12-18 22:19:04,901 INFO L226 Difference]: Without dead ends: 151 [2021-12-18 22:19:04,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=441, Invalid=3519, Unknown=18, NotChecked=2502, Total=6480 [2021-12-18 22:19:04,903 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 744 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1001 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:19:04,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [744 Valid, 1197 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 746 Invalid, 0 Unknown, 1001 Unchecked, 0.4s Time] [2021-12-18 22:19:04,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-18 22:19:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 90. [2021-12-18 22:19:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2021-12-18 22:19:04,906 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 44 [2021-12-18 22:19:04,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:19:04,906 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2021-12-18 22:19:04,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 56 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2021-12-18 22:19:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-18 22:19:04,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:19:04,907 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:19:04,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-18 22:19:05,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:19:05,127 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:19:05,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:19:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1958848316, now seen corresponding path program 2 times [2021-12-18 22:19:05,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:19:05,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685210429] [2021-12-18 22:19:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:19:05,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:19:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:19:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-18 22:19:05,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:19:05,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685210429] [2021-12-18 22:19:05,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685210429] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:19:05,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:19:05,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 22:19:05,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329642459] [2021-12-18 22:19:05,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:19:05,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 22:19:05,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:19:05,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 22:19:05,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:19:05,190 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:05,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:19:05,223 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-12-18 22:19:05,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:19:05,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-12-18 22:19:05,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:19:05,224 INFO L225 Difference]: With dead ends: 76 [2021-12-18 22:19:05,224 INFO L226 Difference]: Without dead ends: 76 [2021-12-18 22:19:05,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:19:05,226 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 58 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:19:05,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 93 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:19:05,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-18 22:19:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-18 22:19:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.173913043478261) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2021-12-18 22:19:05,233 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 47 [2021-12-18 22:19:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:19:05,233 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2021-12-18 22:19:05,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2021-12-18 22:19:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-18 22:19:05,234 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:19:05,234 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:19:05,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-18 22:19:05,235 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:19:05,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:19:05,235 INFO L85 PathProgramCache]: Analyzing trace with hash -645325999, now seen corresponding path program 1 times [2021-12-18 22:19:05,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:19:05,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217841014] [2021-12-18 22:19:05,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:19:05,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:19:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:19:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:19:05,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:19:05,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217841014] [2021-12-18 22:19:05,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217841014] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:19:05,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139834098] [2021-12-18 22:19:05,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:19:05,978 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:19:05,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:19:05,979 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-18 22:19:05,980 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-18 22:19:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:19:06,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 99 conjunts are in the unsatisfiable core [2021-12-18 22:19:06,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:19:06,129 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:19:06,129 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 11 [2021-12-18 22:19:06,206 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-18 22:19:06,210 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 13 treesize of output 9 [2021-12-18 22:19:06,479 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:19:06,479 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 68 treesize of output 65 [2021-12-18 22:19:06,483 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 33 treesize of output 23 [2021-12-18 22:19:06,486 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 36 treesize of output 38 [2021-12-18 22:19:06,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:19:06,624 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 45 treesize of output 38 [2021-12-18 22:19:06,629 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 30 treesize of output 32 [2021-12-18 22:19:06,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:19:06,634 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 35 treesize of output 34 [2021-12-18 22:19:06,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 72 treesize of output 48 [2021-12-18 22:19:06,807 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 50 treesize of output 32 [2021-12-18 22:19:06,911 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 36 treesize of output 24 [2021-12-18 22:19:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:19:07,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:19:07,320 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1122 Int) (v_ArrVal_1125 Int)) (<= (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1124) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1125)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1122)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1122 Int) (v_ArrVal_1125 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1124) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1125)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1122)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) 1)))) is different from false [2021-12-18 22:19:07,363 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1122 Int) (v_ArrVal_1125 Int)) (<= (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1124) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1125) .cse0)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1122) .cse0))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1122 Int) (v_ArrVal_1125 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1124) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1125) .cse1)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1122) .cse1))) 1)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) is different from false [2021-12-18 22:19:07,444 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:19:07,445 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 86 [2021-12-18 22:19:07,475 INFO L354 Elim1Store]: treesize reduction 90, result has 30.8 percent of original size [2021-12-18 22:19:07,475 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 169 [2021-12-18 22:19:07,490 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 125 treesize of output 111 [2021-12-18 22:19:07,495 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 111 treesize of output 97 [2021-12-18 22:19:07,589 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (<= .cse0 .cse1) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) (<= .cse1 .cse0))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) is different from false [2021-12-18 22:19:07,679 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (let ((.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (<= .cse0 .cse1) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base|)) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse1 .cse0))))) is different from false [2021-12-18 22:19:07,725 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (let ((.cse3 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse2 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) .cse0))) (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) v_ArrVal_1117) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1)))) (<= .cse2 .cse3) (<= .cse3 .cse2) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))))))) is different from false [2021-12-18 22:19:07,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1117) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse3) .cse2)))) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) is different from false [2021-12-18 22:19:07,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0) v_ArrVal_1117) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0)))) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1119) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse2) .cse1)))) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) v_ArrVal_1119) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse3)) |c_ULTIMATE.start_sll_create_#res#1.base|)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) is different from false [2021-12-18 22:19:07,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_1119) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1119) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse2) .cse1)))) (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) v_ArrVal_1117) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) is different from false [2021-12-18 22:19:07,975 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1119) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse0)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1119) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse2) .cse1)))) (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3) v_ArrVal_1117) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) is different from false [2021-12-18 22:19:07,990 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:19:07,990 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 81 [2021-12-18 22:19:07,993 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 115 treesize of output 109 [2021-12-18 22:19:07,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:19:07,999 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 103 treesize of output 91 [2021-12-18 22:19:08,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:19:08,002 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 76 treesize of output 72 [2021-12-18 22:19:08,007 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:19:08,008 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 44 treesize of output 40 [2021-12-18 22:19:08,013 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:19:08,014 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 37 treesize of output 33 [2021-12-18 22:19:08,016 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:19:08,017 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 30 treesize of output 26 [2021-12-18 22:19:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-18 22:19:08,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139834098] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:19:08,133 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:19:08,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23, 24] total 61 [2021-12-18 22:19:08,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990518662] [2021-12-18 22:19:08,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:19:08,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-12-18 22:19:08,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:19:08,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-12-18 22:19:08,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2508, Unknown=9, NotChecked=972, Total=3660 [2021-12-18 22:19:08,135 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 61 states, 61 states have (on average 1.9180327868852458) internal successors, (117), 61 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:10,518 WARN L838 $PredicateComparison]: unable to prove that (and (= 1 (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1119) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse0)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1119) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse2) .cse1)))) (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3) v_ArrVal_1117) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= 1 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_node_create_#res#1.base|))) is different from false [2021-12-18 22:19:12,521 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_1119) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1119) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse2) .cse1)))) (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) v_ArrVal_1117) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) is different from false [2021-12-18 22:19:14,526 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_1119) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1119) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse2) .cse1)))) (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) v_ArrVal_1117) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) is different from false [2021-12-18 22:19:16,549 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0) v_ArrVal_1117) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0)))) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1119) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse2) .cse1)))) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) v_ArrVal_1119) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse3)) |c_ULTIMATE.start_sll_create_#res#1.base|)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) |c_ULTIMATE.start_sll_create_#res#1.base|))) is different from false [2021-12-18 22:19:18,554 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse1) (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1117) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse4) .cse3)))) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse5) v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse5)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse1 |c_ULTIMATE.start_main_~len~0#1|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-18 22:19:20,560 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~len~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (let ((.cse4 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse3 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) .cse1))) (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) v_ArrVal_1117) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)))) (<= .cse3 .cse4) (<= .cse4 .cse3) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))))))))) is different from false [2021-12-18 22:19:22,589 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (let ((.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (<= .cse0 .cse1) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base|)) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse1 .cse0))))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (<= |c_ULTIMATE.start_main_~len~0#1| .cse2) (not (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~len~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse2 |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-18 22:19:24,628 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_~head#1.offset|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (<= .cse0 .cse1) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1119) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) (<= .cse1 .cse0))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse2) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_~head#1.base|) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~len~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse2 |c_ULTIMATE.start_main_~len~0#1|) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-18 22:19:26,634 WARN L838 $PredicateComparison]: unable to prove that (and (= 1 (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1119) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse0)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1119 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1119) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse2) .cse1)))) (forall ((v_ArrVal_1117 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3) v_ArrVal_1117) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_8) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= 1 (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_node_create_#res#1.base|))) is different from false [2021-12-18 22:19:26,638 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1122 Int) (v_ArrVal_1125 Int)) (<= (+ (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1124) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1125) .cse1)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1122) .cse1))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1122 Int) (v_ArrVal_1125 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1124) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1125) .cse2)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1122) .cse2))) 1)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_int| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (+ |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~len~0#1|)) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse3)))) is different from false [2021-12-18 22:19:26,642 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse1 (+ (select (select |c_#memory_int| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1122 Int) (v_ArrVal_1125 Int)) (<= (+ (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1124) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1125) .cse2)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1122) .cse2))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1122 Int) (v_ArrVal_1125 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1124) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1125) .cse3)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1122) .cse3))) 1)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse1 .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4))))) is different from false [2021-12-18 22:19:27,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:19:27,491 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2021-12-18 22:19:27,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-18 22:19:27,491 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.9180327868852458) internal successors, (117), 61 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-18 22:19:27,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:19:27,492 INFO L225 Difference]: With dead ends: 85 [2021-12-18 22:19:27,492 INFO L226 Difference]: Without dead ends: 85 [2021-12-18 22:19:27,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 20 IntricatePredicates, 1 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=435, Invalid=4455, Unknown=20, NotChecked=3100, Total=8010 [2021-12-18 22:19:27,494 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 120 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 574 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 22:19:27,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 790 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 887 Invalid, 0 Unknown, 574 Unchecked, 0.5s Time] [2021-12-18 22:19:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-18 22:19:27,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2021-12-18 22:19:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2021-12-18 22:19:27,496 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 48 [2021-12-18 22:19:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:19:27,497 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2021-12-18 22:19:27,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.9180327868852458) internal successors, (117), 61 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2021-12-18 22:19:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-18 22:19:27,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:19:27,498 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-18 22:19:27,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-18 22:19:27,711 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,SelfDestructingSolverStorable20 [2021-12-18 22:19:27,711 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:19:27,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:19:27,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1693462380, now seen corresponding path program 1 times [2021-12-18 22:19:27,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:19:27,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967538837] [2021-12-18 22:19:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:19:27,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:19:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:19:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-18 22:19:27,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:19:27,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967538837] [2021-12-18 22:19:27,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967538837] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:19:27,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150150027] [2021-12-18 22:19:27,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:19:27,943 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:19:27,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:19:27,944 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-18 22:19:27,946 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-18 22:19:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:19:28,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-18 22:19:28,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:19:28,264 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 15 treesize of output 11 [2021-12-18 22:19:28,455 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 29 treesize of output 13 [2021-12-18 22:19:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-18 22:19:28,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:19:28,676 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 36 treesize of output 32 [2021-12-18 22:19:28,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:19:28,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:19:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-18 22:19:28,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150150027] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:19:28,811 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:19:28,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 28 [2021-12-18 22:19:28,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193198554] [2021-12-18 22:19:28,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:19:28,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-18 22:19:28,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:19:28,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-18 22:19:28,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2021-12-18 22:19:28,813 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 28 states, 28 states have (on average 4.142857142857143) internal successors, (116), 28 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:19:29,220 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2021-12-18 22:19:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 22:19:29,221 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.142857142857143) internal successors, (116), 28 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-12-18 22:19:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:19:29,222 INFO L225 Difference]: With dead ends: 99 [2021-12-18 22:19:29,222 INFO L226 Difference]: Without dead ends: 99 [2021-12-18 22:19:29,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2021-12-18 22:19:29,223 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 307 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:19:29,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 516 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 22:19:29,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-18 22:19:29,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2021-12-18 22:19:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2021-12-18 22:19:29,225 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 55 [2021-12-18 22:19:29,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:19:29,225 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2021-12-18 22:19:29,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.142857142857143) internal successors, (116), 28 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2021-12-18 22:19:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-18 22:19:29,226 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:19:29,226 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:19:29,250 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-18 22:19:29,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:19:29,426 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:19:29,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:19:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash 261778123, now seen corresponding path program 2 times [2021-12-18 22:19:29,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:19:29,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383810355] [2021-12-18 22:19:29,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:19:29,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:19:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:19:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:19:29,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:19:29,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383810355] [2021-12-18 22:19:29,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383810355] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:19:29,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209692946] [2021-12-18 22:19:29,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:19:29,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:19:29,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:19:29,496 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:19:29,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-18 22:19:29,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:19:29,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:19:29,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:19:29,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:19:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:19:29,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:19:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:19:29,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209692946] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:19:29,859 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:19:29,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-12-18 22:19:29,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572260898] [2021-12-18 22:19:29,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:19:29,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:19:29,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:19:29,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:19:29,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:19:29,860 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:29,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:19:29,894 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2021-12-18 22:19:29,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 22:19:29,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-12-18 22:19:29,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:19:29,895 INFO L225 Difference]: With dead ends: 71 [2021-12-18 22:19:29,895 INFO L226 Difference]: Without dead ends: 71 [2021-12-18 22:19:29,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:19:29,895 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 78 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:19:29,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 125 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:19:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-18 22:19:29,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-18 22:19:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:29,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2021-12-18 22:19:29,898 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 58 [2021-12-18 22:19:29,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:19:29,898 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2021-12-18 22:19:29,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:29,898 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2021-12-18 22:19:29,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-18 22:19:29,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:19:29,899 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-18 22:19:29,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-18 22:19:30,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-18 22:19:30,115 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:19:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:19:30,116 INFO L85 PathProgramCache]: Analyzing trace with hash 187254194, now seen corresponding path program 1 times [2021-12-18 22:19:30,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:19:30,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523829689] [2021-12-18 22:19:30,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:19:30,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:19:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:19:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-18 22:19:30,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:19:30,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523829689] [2021-12-18 22:19:30,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523829689] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:19:30,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:19:30,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 22:19:30,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055427181] [2021-12-18 22:19:30,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:19:30,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:19:30,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:19:30,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:19:30,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:19:30,191 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:19:30,336 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2021-12-18 22:19:30,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 22:19:30,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-18 22:19:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:19:30,337 INFO L225 Difference]: With dead ends: 82 [2021-12-18 22:19:30,337 INFO L226 Difference]: Without dead ends: 82 [2021-12-18 22:19:30,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:19:30,338 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 225 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:19:30,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 89 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:19:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-18 22:19:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2021-12-18 22:19:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2021-12-18 22:19:30,340 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 59 [2021-12-18 22:19:30,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:19:30,340 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2021-12-18 22:19:30,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2021-12-18 22:19:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-18 22:19:30,341 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:19:30,341 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-18 22:19:30,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-18 22:19:30,341 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:19:30,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:19:30,342 INFO L85 PathProgramCache]: Analyzing trace with hash 187254195, now seen corresponding path program 1 times [2021-12-18 22:19:30,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:19:30,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219229221] [2021-12-18 22:19:30,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:19:30,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:19:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:19:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:19:30,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:19:30,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219229221] [2021-12-18 22:19:30,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219229221] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:19:30,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:19:30,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 22:19:30,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434085016] [2021-12-18 22:19:30,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:19:30,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:19:30,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:19:30,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:19:30,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:19:30,463 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:19:30,659 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-12-18 22:19:30,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:19:30,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-18 22:19:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:19:30,661 INFO L225 Difference]: With dead ends: 80 [2021-12-18 22:19:30,661 INFO L226 Difference]: Without dead ends: 80 [2021-12-18 22:19:30,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:19:30,661 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 283 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:19:30,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 52 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:19:30,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-18 22:19:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2021-12-18 22:19:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 73 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2021-12-18 22:19:30,663 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 59 [2021-12-18 22:19:30,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:19:30,663 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2021-12-18 22:19:30,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2021-12-18 22:19:30,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-18 22:19:30,664 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:19:30,664 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-18 22:19:30,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-18 22:19:30,664 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:19:30,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:19:30,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1509911310, now seen corresponding path program 1 times [2021-12-18 22:19:30,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:19:30,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576434353] [2021-12-18 22:19:30,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:19:30,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:19:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:19:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:19:30,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:19:30,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576434353] [2021-12-18 22:19:30,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576434353] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:19:30,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:19:30,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 22:19:30,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179410727] [2021-12-18 22:19:30,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:19:30,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:19:30,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:19:30,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:19:30,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:19:30,734 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:19:30,836 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2021-12-18 22:19:30,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:19:30,836 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-12-18 22:19:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:19:30,837 INFO L225 Difference]: With dead ends: 77 [2021-12-18 22:19:30,837 INFO L226 Difference]: Without dead ends: 77 [2021-12-18 22:19:30,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:19:30,838 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 265 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:19:30,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 81 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:19:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-18 22:19:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2021-12-18 22:19:30,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-12-18 22:19:30,840 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 60 [2021-12-18 22:19:30,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:19:30,840 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-12-18 22:19:30,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:30,841 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-12-18 22:19:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-18 22:19:30,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:19:30,841 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:19:30,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-18 22:19:30,842 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:19:30,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:19:30,842 INFO L85 PathProgramCache]: Analyzing trace with hash -672727665, now seen corresponding path program 1 times [2021-12-18 22:19:30,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:19:30,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673895523] [2021-12-18 22:19:30,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:19:30,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:19:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:19:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:19:30,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:19:30,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673895523] [2021-12-18 22:19:30,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673895523] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:19:30,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:19:30,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 22:19:30,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33949745] [2021-12-18 22:19:30,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:19:30,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:19:30,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:19:30,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:19:30,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:19:30,920 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:19:31,050 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2021-12-18 22:19:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:19:31,050 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-18 22:19:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:19:31,051 INFO L225 Difference]: With dead ends: 75 [2021-12-18 22:19:31,051 INFO L226 Difference]: Without dead ends: 75 [2021-12-18 22:19:31,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:19:31,053 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:19:31,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 65 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:19:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-18 22:19:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-12-18 22:19:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-12-18 22:19:31,054 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2021-12-18 22:19:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:19:31,055 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-12-18 22:19:31,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-12-18 22:19:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-18 22:19:31,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:19:31,055 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:19:31,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-18 22:19:31,056 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:19:31,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:19:31,056 INFO L85 PathProgramCache]: Analyzing trace with hash -912303337, now seen corresponding path program 1 times [2021-12-18 22:19:31,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:19:31,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101847250] [2021-12-18 22:19:31,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:19:31,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:19:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:19:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-18 22:19:31,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:19:31,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101847250] [2021-12-18 22:19:31,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101847250] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:19:31,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704176174] [2021-12-18 22:19:31,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:19:31,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:19:31,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:19:31,489 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:19:31,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-18 22:19:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:19:31,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 78 conjunts are in the unsatisfiable core [2021-12-18 22:19:31,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:19:31,698 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 22:19:31,698 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-18 22:19:31,808 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 13 treesize of output 9 [2021-12-18 22:19:32,054 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:19:32,055 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 30 treesize of output 31 [2021-12-18 22:19:32,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:19:32,137 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 29 treesize of output 24 [2021-12-18 22:19:32,350 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:19:32,350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2021-12-18 22:19:32,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 22:19:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 22:19:32,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:19:34,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1655 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)) 1)) (forall ((v_ArrVal_1655 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4))))))) is different from false [2021-12-18 22:19:34,871 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1653) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)) 1)) (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1653) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4))))))) is different from false [2021-12-18 22:19:34,914 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1653) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)) 1)) (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1653) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2021-12-18 22:19:34,938 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1653) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)))) (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1653) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2021-12-18 22:19:34,982 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1653) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)))) (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1653) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)) 1))))) is different from false [2021-12-18 22:19:35,003 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1653) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)) 1)) (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1653) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2021-12-18 22:19:35,030 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4)) v_ArrVal_1653) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)))) (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4)) v_ArrVal_1653) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)) 1))))) is different from false [2021-12-18 22:19:35,091 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_1653) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)) 1)) (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_1653) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4))))))) is different from false [2021-12-18 22:19:35,101 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:19:35,102 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2021-12-18 22:19:35,105 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 73 treesize of output 67 [2021-12-18 22:19:35,114 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:19:35,114 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 90 treesize of output 92 [2021-12-18 22:19:35,119 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 89 treesize of output 87 [2021-12-18 22:19:35,123 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 98 treesize of output 96 [2021-12-18 22:19:35,460 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 22:19:35,460 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 36 treesize of output 1 [2021-12-18 22:19:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2021-12-18 22:19:35,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704176174] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:19:35,479 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:19:35,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 21] total 50 [2021-12-18 22:19:35,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843853402] [2021-12-18 22:19:35,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:19:35,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-18 22:19:35,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:19:35,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-18 22:19:35,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1673, Unknown=8, NotChecked=712, Total=2550 [2021-12-18 22:19:35,487 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 51 states, 50 states have (on average 2.58) internal successors, (129), 51 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:19:37,745 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (and (= 1 (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= 1 (select |c_#valid| .cse0)) (= 1 (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_1653) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)) 1)) (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_1653) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4))))))) (= 1 (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_node_create_#res#1.base|)))) is different from false [2021-12-18 22:20:01,812 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= 1 (select |c_#valid| .cse0)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1653) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)) 1)) (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1653) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) (not (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|)))) is different from false [2021-12-18 22:20:29,953 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (select .cse0 4))) (and (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1653) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)) 1)) (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1653) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1)) (= (select |c_#valid| .cse1) 1)))) is different from false [2021-12-18 22:20:31,959 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (select .cse0 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1653) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)) 1)) (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1655 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1653) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4))))))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1)) (= (select |c_#valid| .cse1) 1)))) is different from false [2021-12-18 22:20:32,349 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1655 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4)) 1)) (forall ((v_ArrVal_1655 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1655) 4))))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#valid| .cse0) 1))) is different from false [2021-12-18 22:20:32,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:20:32,644 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2021-12-18 22:20:32,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-18 22:20:32,645 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.58) internal successors, (129), 51 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-18 22:20:32,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:20:32,645 INFO L225 Difference]: With dead ends: 87 [2021-12-18 22:20:32,646 INFO L226 Difference]: Without dead ends: 87 [2021-12-18 22:20:32,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 101 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 59.8s TimeCoverageRelationStatistics Valid=332, Invalid=2892, Unknown=20, NotChecked=1586, Total=4830 [2021-12-18 22:20:32,648 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 182 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 722 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 22:20:32,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 443 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 654 Invalid, 0 Unknown, 722 Unchecked, 0.3s Time] [2021-12-18 22:20:32,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-18 22:20:32,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2021-12-18 22:20:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:20:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2021-12-18 22:20:32,650 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 65 [2021-12-18 22:20:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:20:32,650 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2021-12-18 22:20:32,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.58) internal successors, (129), 51 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:20:32,650 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2021-12-18 22:20:32,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-18 22:20:32,651 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:20:32,651 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:20:32,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-18 22:20:32,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-18 22:20:32,863 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:20:32,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:20:32,864 INFO L85 PathProgramCache]: Analyzing trace with hash -912303336, now seen corresponding path program 1 times [2021-12-18 22:20:32,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:20:32,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793482346] [2021-12-18 22:20:32,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:20:32,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:20:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:20:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-18 22:20:33,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:20:33,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793482346] [2021-12-18 22:20:33,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793482346] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:20:33,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803797203] [2021-12-18 22:20:33,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:20:33,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:20:33,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:20:33,442 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:20:33,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-18 22:20:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:20:33,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 105 conjunts are in the unsatisfiable core [2021-12-18 22:20:33,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:20:33,789 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 22:20:33,789 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 14 treesize of output 20 [2021-12-18 22:20:33,803 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:20:33,804 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 11 [2021-12-18 22:20:33,925 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-18 22:20:33,931 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 13 treesize of output 9 [2021-12-18 22:20:34,277 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:20:34,278 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 42 treesize of output 41 [2021-12-18 22:20:34,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:20:34,284 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 20 treesize of output 22 [2021-12-18 22:20:34,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:20:34,414 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 29 treesize of output 24 [2021-12-18 22:20:34,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:20:34,420 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 19 treesize of output 18 [2021-12-18 22:20:34,736 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:20:34,736 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-18 22:20:34,741 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:20:34,741 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2021-12-18 22:20:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 22:20:34,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:20:37,354 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (and (forall ((v_ArrVal_1771 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 4))) (forall ((v_ArrVal_1771 Int) (v_ArrVal_1773 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1773) 4))))))) is different from false [2021-12-18 22:20:37,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (and (forall ((v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1771 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1768) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 4))) (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1771 Int) (v_ArrVal_1773 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1768) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1769) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1773) 4))))))) is different from false [2021-12-18 22:20:37,502 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (and (forall ((v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1771 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1768) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 4))) (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1771 Int) (v_ArrVal_1773 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1768) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1769) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1773) 4))))))) is different from false [2021-12-18 22:20:37,531 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (and (forall ((v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1771 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1768) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 4))) (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1771 Int) (v_ArrVal_1773 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1768) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1769) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1773) 4)))))))) is different from false [2021-12-18 22:20:37,593 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (and (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1771 Int) (v_ArrVal_1773 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1768) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1769) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1773) 4))))) (forall ((v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1771 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1768) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 4)))))) is different from false [2021-12-18 22:20:37,620 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (and (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1771 Int) (v_ArrVal_1773 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1768) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1769) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1773) 4))))) (forall ((v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1771 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1768) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 4)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|))) is different from false [2021-12-18 22:20:37,646 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (and (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1771 Int) (v_ArrVal_1773 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1768) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1769) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1773) 4))))) (forall ((v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1771 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4)) v_ArrVal_1768) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 4)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|))) is different from false [2021-12-18 22:20:37,701 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (and (forall ((v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1771 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_1768) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 4))) (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1771 Int) (v_ArrVal_1773 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1768) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1769) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1773) 4)))))))) is different from false [2021-12-18 22:20:37,747 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:20:37,748 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2021-12-18 22:20:37,753 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:20:37,754 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 64 [2021-12-18 22:20:37,756 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 93 treesize of output 89 [2021-12-18 22:20:37,759 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 154 treesize of output 146 [2021-12-18 22:20:37,768 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:20:37,769 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 196 treesize of output 196 [2021-12-18 22:20:37,777 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:20:37,778 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 243 treesize of output 243 [2021-12-18 22:20:37,794 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 261 treesize of output 255 [2021-12-18 22:20:37,801 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 311 treesize of output 303 [2021-12-18 22:20:37,807 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 315 treesize of output 313 [2021-12-18 22:20:38,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:20:38,636 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 25 treesize of output 21 [2021-12-18 22:20:38,641 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 22:20:38,642 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 13 treesize of output 12 [2021-12-18 22:20:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2021-12-18 22:20:38,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803797203] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:20:38,731 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:20:38,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 24] total 70 [2021-12-18 22:20:38,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35453349] [2021-12-18 22:20:38,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:20:38,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2021-12-18 22:20:38,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:20:38,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-12-18 22:20:38,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=3661, Unknown=8, NotChecked=1032, Total=4970 [2021-12-18 22:20:38,733 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 71 states, 70 states have (on average 2.3857142857142857) internal successors, (167), 71 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:21:34,980 WARN L227 SmtUtils]: Spent 55.77s on a formula simplification. DAG size of input: 80 DAG size of output: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 22:21:36,612 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (select |c_#length| .cse1))) (and (= .cse0 8) (<= 8 .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (and (forall ((v_ArrVal_1771 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 4))) (forall ((v_ArrVal_1771 Int) (v_ArrVal_1773 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1771) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1773) 4))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) (not (= .cse1 |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-18 22:21:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:21:38,210 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2021-12-18 22:21:38,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-18 22:21:38,211 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 2.3857142857142857) internal successors, (167), 71 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-18 22:21:38,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:21:38,212 INFO L225 Difference]: With dead ends: 102 [2021-12-18 22:21:38,212 INFO L226 Difference]: Without dead ends: 102 [2021-12-18 22:21:38,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2046 ImplicationChecksByTransitivity, 62.4s TimeCoverageRelationStatistics Valid=982, Invalid=7601, Unknown=9, NotChecked=1710, Total=10302 [2021-12-18 22:21:38,215 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 297 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 2338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 849 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 22:21:38,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 880 Invalid, 2338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1426 Invalid, 0 Unknown, 849 Unchecked, 0.6s Time] [2021-12-18 22:21:38,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-18 22:21:38,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 80. [2021-12-18 22:21:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.12) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:21:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2021-12-18 22:21:38,217 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 65 [2021-12-18 22:21:38,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:21:38,217 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2021-12-18 22:21:38,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 2.3857142857142857) internal successors, (167), 71 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:21:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2021-12-18 22:21:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-18 22:21:38,218 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:21:38,218 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:21:38,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-18 22:21:38,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-18 22:21:38,442 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:21:38,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:21:38,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1783366217, now seen corresponding path program 1 times [2021-12-18 22:21:38,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:21:38,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782820959] [2021-12-18 22:21:38,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:21:38,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:21:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:21:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-18 22:21:38,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:21:38,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782820959] [2021-12-18 22:21:38,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782820959] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:21:38,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155168534] [2021-12-18 22:21:38,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:21:38,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:21:38,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:21:38,852 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:21:38,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-18 22:21:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:21:39,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 80 conjunts are in the unsatisfiable core [2021-12-18 22:21:39,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:21:39,106 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:21:39,107 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 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 22:21:39,149 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-18 22:21:39,300 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:21:39,301 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 27 treesize of output 28 [2021-12-18 22:21:39,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:21:39,365 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 28 treesize of output 23 [2021-12-18 22:21:39,533 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:21:39,533 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2021-12-18 22:21:39,605 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 22:21:39,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:21:40,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_40| Int) (v_ArrVal_1884 Int)) (or (not (= 0 (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_40| v_ArrVal_1884) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_40|))) is different from false [2021-12-18 22:21:40,119 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_40| Int) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1884 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_40|) (not (= 0 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_40| v_ArrVal_1884) 4))))) is different from false [2021-12-18 22:21:40,141 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_40| Int) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1884 Int)) (or (not (= 0 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_40| v_ArrVal_1884) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_40|))) is different from false [2021-12-18 22:21:40,153 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_40| Int) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1884 Int)) (or (not (= 0 (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1882) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_40| v_ArrVal_1884) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_40|))) is different from false [2021-12-18 22:21:40,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_40| Int) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1884 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_40|) (not (= 0 (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1882) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_40| v_ArrVal_1884) 4))))) is different from false [2021-12-18 22:21:40,193 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_40| Int) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1884 Int)) (or (not (= 0 (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1882) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_40| v_ArrVal_1884) 4))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_40|))) is different from false [2021-12-18 22:21:40,201 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_40| Int) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1884 Int)) (or (not (= 0 (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4)) v_ArrVal_1882) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_40| v_ArrVal_1884) 4))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_40|))) is different from false [2021-12-18 22:21:40,221 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_40| Int) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1884 Int)) (or (not (= 0 (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_1882) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_40| v_ArrVal_1884) 4))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_40|))) is different from false [2021-12-18 22:21:40,227 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:21:40,227 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-18 22:21:40,229 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 41 treesize of output 37 [2021-12-18 22:21:40,232 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 39 treesize of output 37 [2021-12-18 22:21:40,239 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:21:40,239 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 57 treesize of output 61 [2021-12-18 22:21:40,399 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 22:21:40,400 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 13 treesize of output 12 [2021-12-18 22:21:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2021-12-18 22:21:40,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155168534] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:21:40,411 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:21:40,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 25] total 47 [2021-12-18 22:21:40,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10300421] [2021-12-18 22:21:40,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:21:40,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-18 22:21:40,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:21:40,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-18 22:21:40,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1364, Unknown=8, NotChecked=648, Total=2162 [2021-12-18 22:21:40,413 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 47 states, 47 states have (on average 2.9148936170212765) internal successors, (137), 47 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:21:50,024 WARN L227 SmtUtils]: Spent 8.95s on a formula simplification. DAG size of input: 39 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 22:21:50,509 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_40| Int) (v_ArrVal_1884 Int)) (or (not (= 0 (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_40| v_ArrVal_1884) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_40|))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| .cse0) (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-18 22:21:50,811 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_40| Int) (v_ArrVal_1884 Int)) (or (not (= 0 (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_40| v_ArrVal_1884) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_40|))) (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-18 22:21:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:21:51,128 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2021-12-18 22:21:51,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-18 22:21:51,129 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.9148936170212765) internal successors, (137), 47 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-12-18 22:21:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:21:51,129 INFO L225 Difference]: With dead ends: 90 [2021-12-18 22:21:51,129 INFO L226 Difference]: Without dead ends: 90 [2021-12-18 22:21:51,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 105 SyntacticMatches, 12 SemanticMatches, 69 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=480, Invalid=3210, Unknown=10, NotChecked=1270, Total=4970 [2021-12-18 22:21:51,130 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 140 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 630 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 22:21:51,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 575 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 718 Invalid, 0 Unknown, 630 Unchecked, 0.3s Time] [2021-12-18 22:21:51,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-18 22:21:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2021-12-18 22:21:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:21:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2021-12-18 22:21:51,132 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 66 [2021-12-18 22:21:51,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:21:51,132 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2021-12-18 22:21:51,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.9148936170212765) internal successors, (137), 47 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:21:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2021-12-18 22:21:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-18 22:21:51,133 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:21:51,133 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-18 22:21:51,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-18 22:21:51,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:21:51,333 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:21:51,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:21:51,334 INFO L85 PathProgramCache]: Analyzing trace with hash 124432906, now seen corresponding path program 1 times [2021-12-18 22:21:51,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:21:51,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839092334] [2021-12-18 22:21:51,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:21:51,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:21:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:21:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 22:21:51,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:21:51,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839092334] [2021-12-18 22:21:51,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839092334] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:21:51,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112413893] [2021-12-18 22:21:51,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:21:51,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:21:51,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:21:51,818 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:21:51,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-18 22:21:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:21:51,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 75 conjunts are in the unsatisfiable core [2021-12-18 22:21:51,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:21:52,107 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:21:52,107 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 11 [2021-12-18 22:21:52,158 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 13 treesize of output 9 [2021-12-18 22:21:52,354 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:21:52,354 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 28 treesize of output 29 [2021-12-18 22:21:52,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:21:52,426 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 29 treesize of output 24 [2021-12-18 22:21:52,587 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:21:52,587 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2021-12-18 22:21:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-18 22:21:52,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:21:53,225 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_1995 Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1995) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2021-12-18 22:21:53,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1995 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1995) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2021-12-18 22:21:53,271 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1995 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1995) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2021-12-18 22:21:53,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1995 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1993) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1995) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2021-12-18 22:21:53,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1995 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1993) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1995) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2021-12-18 22:21:53,306 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1995 Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1993) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1995) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-18 22:21:53,315 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1995 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4)) v_ArrVal_1993) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1995) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-18 22:21:53,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1995 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_1993) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1995) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2021-12-18 22:21:53,344 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:21:53,344 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2021-12-18 22:21:53,346 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 42 treesize of output 38 [2021-12-18 22:21:53,352 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:21:53,352 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 36 treesize of output 40 [2021-12-18 22:21:53,356 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 26 treesize of output 24 [2021-12-18 22:21:53,542 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 22:21:53,542 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 13 treesize of output 12 [2021-12-18 22:21:53,571 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2021-12-18 22:21:53,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112413893] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:21:53,572 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:21:53,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 47 [2021-12-18 22:21:53,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136495518] [2021-12-18 22:21:53,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:21:53,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-18 22:21:53,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:21:53,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-18 22:21:53,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1438, Unknown=8, NotChecked=664, Total=2256 [2021-12-18 22:21:53,573 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 48 states, 47 states have (on average 2.851063829787234) internal successors, (134), 48 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:21:56,471 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (= |c_ULTIMATE.start_sll_update_at_~head#1.base| .cse0) (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_1995 Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1995) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))))) is different from false [2021-12-18 22:21:56,788 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_1995 Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1995) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))))) is different from false [2021-12-18 22:21:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:21:57,292 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2021-12-18 22:21:57,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-18 22:21:57,293 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.851063829787234) internal successors, (134), 48 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-12-18 22:21:57,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:21:57,293 INFO L225 Difference]: With dead ends: 81 [2021-12-18 22:21:57,293 INFO L226 Difference]: Without dead ends: 81 [2021-12-18 22:21:57,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 107 SyntacticMatches, 13 SemanticMatches, 66 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=418, Invalid=2918, Unknown=10, NotChecked=1210, Total=4556 [2021-12-18 22:21:57,294 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 171 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 659 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:21:57,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 792 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 869 Invalid, 0 Unknown, 659 Unchecked, 0.4s Time] [2021-12-18 22:21:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-18 22:21:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-12-18 22:21:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.105263157894737) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:21:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2021-12-18 22:21:57,296 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 68 [2021-12-18 22:21:57,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:21:57,296 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2021-12-18 22:21:57,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.851063829787234) internal successors, (134), 48 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:21:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2021-12-18 22:21:57,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-18 22:21:57,296 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:21:57,297 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:21:57,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-18 22:21:57,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:21:57,499 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:21:57,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:21:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash 424087740, now seen corresponding path program 2 times [2021-12-18 22:21:57,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:21:57,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760172999] [2021-12-18 22:21:57,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:21:57,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:21:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:21:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 22:21:58,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:21:58,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760172999] [2021-12-18 22:21:58,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760172999] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:21:58,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707119867] [2021-12-18 22:21:58,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:21:58,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:21:58,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:21:58,432 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:21:58,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-18 22:21:58,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:21:58,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:21:58,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 112 conjunts are in the unsatisfiable core [2021-12-18 22:21:58,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:21:58,704 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-18 22:21:58,709 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-18 22:21:58,771 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:21:58,771 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 11 [2021-12-18 22:21:58,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 14 treesize of output 16 [2021-12-18 22:21:58,841 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-18 22:21:58,853 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-18 22:21:58,858 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-18 22:21:58,961 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 19 treesize of output 18 [2021-12-18 22:21:58,965 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 19 treesize of output 18 [2021-12-18 22:21:59,359 INFO L354 Elim1Store]: treesize reduction 84, result has 37.3 percent of original size [2021-12-18 22:21:59,359 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 77 treesize of output 88 [2021-12-18 22:21:59,407 INFO L354 Elim1Store]: treesize reduction 54, result has 51.8 percent of original size [2021-12-18 22:21:59,407 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 74 [2021-12-18 22:22:00,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:00,341 INFO L354 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2021-12-18 22:22:00,342 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 153 treesize of output 144 [2021-12-18 22:22:00,346 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 124 [2021-12-18 22:22:00,351 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-18 22:22:00,351 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 119 treesize of output 97 [2021-12-18 22:22:06,918 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-12-18 22:22:06,918 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 38 [2021-12-18 22:22:06,924 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:06,924 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-18 22:22:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 22:22:07,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:22:08,485 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (and (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int)) (= (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120))) (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 4)))) 4) 0)) (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (= (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2118)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2121) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117)) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120) 4))) 4) 0))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) is different from false [2021-12-18 22:22:08,580 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (and (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int)) (= (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120))) (select (store .cse0 |c_ULTIMATE.start_sll_create_#res#1.base| .cse1) (select .cse1 4)))) 4) 0)) (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (= (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2118)) |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_2121) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117)) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120) 4))) 4) 0))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) is different from false [2021-12-18 22:22:08,679 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (and (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int)) (= (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120))) (select (store .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (select .cse1 4)))) 4) 0)) (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (= (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2118)) |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2121) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120) 4))) 4) 0))) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) is different from false [2021-12-18 22:22:08,989 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (and (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (= (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2118)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2121) (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120) 4))) 4) 0)) (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int)) (= (select (let ((.cse1 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117))))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120))) (select (store .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) (select .cse2 4)))) 4) 0))) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) is different from false [2021-12-18 22:22:09,208 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2112 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2112) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4) v_ArrVal_2112) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (and (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int)) (= (select (let ((.cse0 (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117)))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120))) (select (store .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) (select .cse1 4)))) 4) 0)) (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (= (select (let ((.cse7 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse6 (select .cse9 4))) (select (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse7 v_ArrVal_2112)))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2118))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2121) (select (store (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9))) (store .cse8 .cse6 (store (select .cse8 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120) 4))))) 4) 0))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) is different from false [2021-12-18 22:22:09,422 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2112 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2112) (and (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int)) (= (select (let ((.cse0 (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117)))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_node_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120))) (select (store .cse0 |c_ULTIMATE.start_node_create_#res#1.base| .cse1) (select .cse1 4)))) 4) 0)) (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (= (select (let ((.cse7 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse6 (select .cse9 4))) (select (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse7 v_ArrVal_2112)))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2118))) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_2121) (select (store (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse9))) (store .cse8 .cse6 (store (select .cse8 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117))) |c_ULTIMATE.start_node_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120) 4))))) 4) 0))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4) v_ArrVal_2112) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|))) is different from false [2021-12-18 22:22:11,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2112 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2112) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 4) v_ArrVal_2112) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (and (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (= (select (let ((.cse2 (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 4))) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse1 (select .cse4 4))) (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse2 v_ArrVal_2112)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2118))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2121) (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse4))) (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120) 4))))) 4) 0)) (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int)) (= (select (let ((.cse5 (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse9)) (.cse8 (select .cse9 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117)))))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120))) (select (store .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse6) (select .cse6 4)))) 4) 0))))) is different from false [2021-12-18 22:22:11,710 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-12-18 22:22:11,710 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 252 treesize of output 259 [2021-12-18 22:22:11,774 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-12-18 22:22:11,775 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 386 treesize of output 305 [2021-12-18 22:22:11,894 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 7 [2021-12-18 22:22:12,404 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:12,405 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 25 treesize of output 25 [2021-12-18 22:22:13,089 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:13,089 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 13 treesize of output 17 [2021-12-18 22:22:13,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:13,186 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-18 22:22:13,364 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:13,364 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 13 treesize of output 17 [2021-12-18 22:22:13,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:13,564 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-18 22:22:13,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:13,707 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-18 22:22:13,871 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< (select v_arrayElimArr_11 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_11 .cse0)) (and (or (not (= 0 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (and (forall ((v_prenex_20 Int) (v_prenex_19 Int)) (= (select (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_prenex_20))))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_prenex_19))) (select (store .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse2) (select .cse2 4)))) 4) 0)) (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (= (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2118))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2121) (select (store (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120) 4)) 4) 0)))) (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (= (select (let ((.cse7 (select v_arrayElimArr_12 4))) (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2118))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2121) (select (store (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120) 4))) 4) 0)) (forall ((v_prenex_20 Int) (v_prenex_19 Int)) (= (select (let ((.cse9 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse12 (select v_arrayElimArr_12 4))) (store .cse11 .cse12 (store (select .cse11 .cse12) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_prenex_20))))) (let ((.cse10 (store (select .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_prenex_19))) (select (store .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse10) (select .cse10 4)))) 4) 0)))))) is different from false [2021-12-18 22:22:13,989 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:13,990 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 13 treesize of output 17 [2021-12-18 22:22:14,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:14,076 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-18 22:22:14,235 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:14,236 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 13 treesize of output 17 [2021-12-18 22:22:14,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:14,456 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-18 22:22:14,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:14,593 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-18 22:22:14,795 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:14,796 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 13 treesize of output 17 [2021-12-18 22:22:14,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:14,882 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-18 22:22:15,040 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:15,040 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 13 treesize of output 17 [2021-12-18 22:22:15,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:15,231 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-18 22:22:15,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:15,368 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-18 22:22:15,547 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 11 treesize of output 7 [2021-12-18 22:22:15,595 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 11 treesize of output 7 [2021-12-18 22:22:15,737 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 11 treesize of output 7 [2021-12-18 22:22:15,908 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 11 treesize of output 7 [2021-12-18 22:22:15,974 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (let ((.cse0 (select v_arrayElimArr_11 4))) (or (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (and (forall ((v_prenex_20 Int) (v_prenex_19 Int)) (= (select (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse4 (select v_arrayElimArr_12 4))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_prenex_20))))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_prenex_19))) (select (store .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_33| .cse2) (select .cse2 4)))) 4) 0)) (forall ((v_prenex_20 Int) (v_prenex_19 Int)) (= (select (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_prenex_20))))) (let ((.cse6 (store (select .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_prenex_19))) (select (store .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33| .cse6) (select .cse6 4)))) 4) 0)) (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (= (select (select (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse8 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2118))) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2121) (select (store (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117))) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120) 4)) 4) 0)) (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (= (select (let ((.cse11 (select v_arrayElimArr_12 4))) (select (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse10 .cse11 (store (select .cse10 .cse11) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2118))) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2121) (select (store (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse12 .cse11 (store (select .cse12 .cse11) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117))) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120) 4))) 4) 0))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| .cse0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))))) is different from false [2021-12-18 22:22:16,041 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 11 treesize of output 7 [2021-12-18 22:22:16,085 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 11 treesize of output 7 [2021-12-18 22:22:16,224 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 11 treesize of output 7 [2021-12-18 22:22:16,402 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 11 treesize of output 7 [2021-12-18 22:22:16,533 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 11 treesize of output 7 [2021-12-18 22:22:16,692 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 11 treesize of output 7 [2021-12-18 22:22:16,751 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (let ((.cse0 (select v_arrayElimArr_11 4))) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| .cse0) (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (and (forall ((v_prenex_20 Int) (v_prenex_19 Int)) (= (select (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse4 (select v_arrayElimArr_12 4))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_prenex_20))))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_prenex_19))) (select (store .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_33| .cse2) (select .cse2 4)))) 4) 0)) (forall ((v_ArrVal_2120 Int) (v_ArrVal_2117 Int) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2118 Int)) (= (select (let ((.cse6 (select v_arrayElimArr_12 4))) (select (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2118))) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2121) (select (store (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse7 .cse6 (store (select .cse7 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2117))) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2120) 4))) 4) 0))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))))) is different from false [2021-12-18 22:22:16,771 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:16,771 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 221 [2021-12-18 22:22:16,778 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:16,779 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 151 [2021-12-18 22:22:16,781 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:22:16,795 INFO L354 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2021-12-18 22:22:16,795 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 607 treesize of output 574 [2021-12-18 22:22:16,800 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:22:16,810 INFO L354 Elim1Store]: treesize reduction 9, result has 30.8 percent of original size [2021-12-18 22:22:16,810 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1194 treesize of output 1136 [2021-12-18 22:22:16,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:22:16,827 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 414 treesize of output 324 [2021-12-18 22:22:16,837 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-18 22:22:16,837 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 22:22:16,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2021-12-18 22:22:16,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899813854] [2021-12-18 22:22:16,838 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 22:22:16,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-18 22:22:16,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:22:16,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-18 22:22:16,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=3540, Unknown=30, NotChecked=1290, Total=5112 [2021-12-18 22:22:16,840 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 22:22:16,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=252, Invalid=3540, Unknown=30, NotChecked=1290, Total=5112 [2021-12-18 22:22:16,846 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 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-18 22:22:16,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:22:16,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-18 22:22:17,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:22:17,072 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.smtlibutils.IncrementalPlicationChecker@4e1acf62 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-18 22:22:17,075 INFO L158 Benchmark]: Toolchain (without parser) took 236466.45ms. Allocated memory was 107.0MB in the beginning and 192.9MB in the end (delta: 86.0MB). Free memory was 77.8MB in the beginning and 111.7MB in the end (delta: -33.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2021-12-18 22:22:17,075 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 107.0MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 22:22:17,075 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.76ms. Allocated memory is still 107.0MB. Free memory was 77.6MB in the beginning and 75.5MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-18 22:22:17,075 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.04ms. Allocated memory is still 107.0MB. Free memory was 75.5MB in the beginning and 73.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 22:22:17,075 INFO L158 Benchmark]: Boogie Preprocessor took 34.66ms. Allocated memory is still 107.0MB. Free memory was 73.4MB in the beginning and 71.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 22:22:17,076 INFO L158 Benchmark]: RCFGBuilder took 372.31ms. Allocated memory is still 107.0MB. Free memory was 71.7MB in the beginning and 57.4MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-18 22:22:17,076 INFO L158 Benchmark]: TraceAbstraction took 235546.95ms. Allocated memory was 107.0MB in the beginning and 192.9MB in the end (delta: 86.0MB). Free memory was 56.7MB in the beginning and 111.7MB in the end (delta: -55.1MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2021-12-18 22:22:17,079 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.20ms. Allocated memory is still 107.0MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.76ms. Allocated memory is still 107.0MB. Free memory was 77.6MB in the beginning and 75.5MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.04ms. Allocated memory is still 107.0MB. Free memory was 75.5MB in the beginning and 73.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.66ms. Allocated memory is still 107.0MB. Free memory was 73.4MB in the beginning and 71.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.31ms. Allocated memory is still 107.0MB. Free memory was 71.7MB in the beginning and 57.4MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 235546.95ms. Allocated memory was 107.0MB in the beginning and 192.9MB in the end (delta: 86.0MB). Free memory was 56.7MB in the beginning and 111.7MB in the end (delta: -55.1MB). Peak memory consumption was 34.6MB. 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.smtlibutils.IncrementalPlicationChecker@4e1acf62 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@4e1acf62: 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-18 22:22:17,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 22:22:18,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 22:22:18,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 22:22:18,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 22:22:18,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 22:22:18,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 22:22:18,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 22:22:18,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 22:22:18,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 22:22:18,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 22:22:18,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 22:22:19,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 22:22:19,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 22:22:19,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 22:22:19,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 22:22:19,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 22:22:19,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 22:22:19,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 22:22:19,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 22:22:19,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 22:22:19,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 22:22:19,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 22:22:19,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 22:22:19,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 22:22:19,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 22:22:19,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 22:22:19,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 22:22:19,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 22:22:19,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 22:22:19,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 22:22:19,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 22:22:19,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 22:22:19,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 22:22:19,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 22:22:19,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 22:22:19,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 22:22:19,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 22:22:19,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 22:22:19,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 22:22:19,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 22:22:19,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 22:22:19,042 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-18 22:22:19,078 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 22:22:19,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 22:22:19,080 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 22:22:19,080 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 22:22:19,081 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 22:22:19,081 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 22:22:19,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 22:22:19,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 22:22:19,083 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 22:22:19,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 22:22:19,084 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 22:22:19,084 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 22:22:19,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 22:22:19,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 22:22:19,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 22:22:19,085 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 22:22:19,085 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 22:22:19,085 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 22:22:19,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 22:22:19,086 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 22:22:19,086 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 22:22:19,086 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 22:22:19,087 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 22:22:19,087 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 22:22:19,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 22:22:19,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 22:22:19,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 22:22:19,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:22:19,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 22:22:19,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 22:22:19,088 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 22:22:19,089 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 22:22:19,089 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 22:22:19,089 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 22:22:19,089 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2021-12-18 22:22:19,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 22:22:19,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 22:22:19,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 22:22:19,438 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 22:22:19,439 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 22:22:19,440 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-12-18 22:22:19,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f32a8f14/1f104023a47a4f6a8d3df9d1421cf610/FLAG39997abfa [2021-12-18 22:22:19,940 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 22:22:19,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-12-18 22:22:19,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f32a8f14/1f104023a47a4f6a8d3df9d1421cf610/FLAG39997abfa [2021-12-18 22:22:20,291 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f32a8f14/1f104023a47a4f6a8d3df9d1421cf610 [2021-12-18 22:22:20,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 22:22:20,294 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 22:22:20,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 22:22:20,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 22:22:20,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 22:22:20,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:22:20" (1/1) ... [2021-12-18 22:22:20,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a767f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:20, skipping insertion in model container [2021-12-18 22:22:20,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:22:20" (1/1) ... [2021-12-18 22:22:20,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 22:22:20,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 22:22:20,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2021-12-18 22:22:20,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:22:20,584 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 22:22:20,617 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/sll2n_update_all_reverse.i[24236,24249] [2021-12-18 22:22:20,618 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:22:20,641 INFO L208 MainTranslator]: Completed translation [2021-12-18 22:22:20,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:20 WrapperNode [2021-12-18 22:22:20,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 22:22:20,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 22:22:20,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 22:22:20,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 22:22:20,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:20" (1/1) ... [2021-12-18 22:22:20,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:20" (1/1) ... [2021-12-18 22:22:20,680 INFO L137 Inliner]: procedures = 129, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2021-12-18 22:22:20,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 22:22:20,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 22:22:20,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 22:22:20,682 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 22:22:20,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:20" (1/1) ... [2021-12-18 22:22:20,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:20" (1/1) ... [2021-12-18 22:22:20,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:20" (1/1) ... [2021-12-18 22:22:20,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:20" (1/1) ... [2021-12-18 22:22:20,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:20" (1/1) ... [2021-12-18 22:22:20,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:20" (1/1) ... [2021-12-18 22:22:20,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:20" (1/1) ... [2021-12-18 22:22:20,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 22:22:20,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 22:22:20,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 22:22:20,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 22:22:20,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:20" (1/1) ... [2021-12-18 22:22:20,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:22:20,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:22:20,732 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-18 22:22:20,752 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-18 22:22:20,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-18 22:22:20,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 22:22:20,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 22:22:20,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 22:22:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 22:22:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 22:22:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-18 22:22:20,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 22:22:20,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 22:22:20,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 22:22:20,924 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 22:22:20,926 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 22:22:21,254 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 22:22:21,259 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 22:22:21,259 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-18 22:22:21,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:22:21 BoogieIcfgContainer [2021-12-18 22:22:21,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 22:22:21,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 22:22:21,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 22:22:21,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 22:22:21,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:22:20" (1/3) ... [2021-12-18 22:22:21,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@931f385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:22:21, skipping insertion in model container [2021-12-18 22:22:21,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:20" (2/3) ... [2021-12-18 22:22:21,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@931f385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:22:21, skipping insertion in model container [2021-12-18 22:22:21,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:22:21" (3/3) ... [2021-12-18 22:22:21,267 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2021-12-18 22:22:21,271 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 22:22:21,271 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-12-18 22:22:21,309 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 22:22:21,315 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-18 22:22:21,315 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-12-18 22:22:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-18 22:22:21,338 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:21,338 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-18 22:22:21,338 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:21,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:21,345 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2021-12-18 22:22:21,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:21,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557747412] [2021-12-18 22:22:21,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:21,353 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:21,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:21,354 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-18 22:22:21,355 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-18 22:22:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:21,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 22:22:21,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:21,588 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-18 22:22:21,607 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-18 22:22:21,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:22:21,608 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:21,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557747412] [2021-12-18 22:22:21,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557747412] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:21,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:21,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:22:21,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844711417] [2021-12-18 22:22:21,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:21,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:22:21,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:21,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:22:21,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:22:21,643 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:21,783 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2021-12-18 22:22:21,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:22:21,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-18 22:22:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:21,798 INFO L225 Difference]: With dead ends: 109 [2021-12-18 22:22:21,798 INFO L226 Difference]: Without dead ends: 104 [2021-12-18 22:22:21,800 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-18 22:22:21,802 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:21,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:22:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-18 22:22:21,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2021-12-18 22:22:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.6) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2021-12-18 22:22:21,845 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2021-12-18 22:22:21,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:21,846 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2021-12-18 22:22:21,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:21,846 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2021-12-18 22:22:21,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-18 22:22:21,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:21,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-18 22:22:21,858 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-18 22:22:22,055 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-18 22:22:22,056 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2021-12-18 22:22:22,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:22,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521865440] [2021-12-18 22:22:22,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:22,057 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:22,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:22,059 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-18 22:22:22,060 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-18 22:22:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:22,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 22:22:22,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:22,149 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-18 22:22:22,174 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-18 22:22:22,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:22:22,174 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:22,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521865440] [2021-12-18 22:22:22,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521865440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:22,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:22,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:22:22,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993988856] [2021-12-18 22:22:22,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:22,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:22:22,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:22,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:22:22,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:22:22,177 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:22,308 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2021-12-18 22:22:22,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:22:22,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-18 22:22:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:22,314 INFO L225 Difference]: With dead ends: 102 [2021-12-18 22:22:22,314 INFO L226 Difference]: Without dead ends: 102 [2021-12-18 22:22:22,314 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-18 22:22:22,315 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:22,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:22:22,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-18 22:22:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2021-12-18 22:22:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.55) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-12-18 22:22:22,322 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2021-12-18 22:22:22,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:22,322 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-12-18 22:22:22,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-12-18 22:22:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-18 22:22:22,323 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:22,323 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:22,335 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-18 22:22:22,523 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-18 22:22:22,524 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:22,525 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2021-12-18 22:22:22,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:22,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718042641] [2021-12-18 22:22:22,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:22,526 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:22,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:22,527 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-18 22:22:22,529 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-18 22:22:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:22,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 22:22:22,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:22,599 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-18 22:22:22,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:22:22,600 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:22,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718042641] [2021-12-18 22:22:22,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718042641] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:22,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:22,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 22:22:22,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032365404] [2021-12-18 22:22:22,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:22,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:22:22,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:22,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:22:22,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:22:22,602 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:22,612 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2021-12-18 22:22:22,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:22:22,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-18 22:22:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:22,614 INFO L225 Difference]: With dead ends: 68 [2021-12-18 22:22:22,614 INFO L226 Difference]: Without dead ends: 68 [2021-12-18 22:22:22,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-18 22:22:22,615 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 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-18 22:22:22,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:22:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-18 22:22:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2021-12-18 22:22:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2021-12-18 22:22:22,621 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2021-12-18 22:22:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:22,621 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2021-12-18 22:22:22,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2021-12-18 22:22:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-18 22:22:22,622 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:22,622 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:22,634 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-18 22:22:22,834 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-18 22:22:22,834 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:22,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:22,835 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2021-12-18 22:22:22,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:22,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070823104] [2021-12-18 22:22:22,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:22,836 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:22,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:22,837 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-18 22:22:22,838 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-18 22:22:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:22,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:22:22,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:22,933 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-18 22:22:22,972 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-18 22:22:22,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:22:22,972 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:22,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070823104] [2021-12-18 22:22:22,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070823104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:22,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:22,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 22:22:22,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037955696] [2021-12-18 22:22:22,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:22,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:22:22,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:22,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:22:22,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:22:22,979 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:23,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:23,128 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-12-18 22:22:23,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:22:23,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-18 22:22:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:23,129 INFO L225 Difference]: With dead ends: 76 [2021-12-18 22:22:23,129 INFO L226 Difference]: Without dead ends: 76 [2021-12-18 22:22:23,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:22:23,130 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 163 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:23,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 67 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:22:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-18 22:22:23,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2021-12-18 22:22:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-12-18 22:22:23,135 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2021-12-18 22:22:23,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:23,135 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-12-18 22:22:23,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-12-18 22:22:23,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-18 22:22:23,135 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:23,136 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:23,146 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-18 22:22:23,336 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-18 22:22:23,336 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:23,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:23,337 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2021-12-18 22:22:23,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:23,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977418385] [2021-12-18 22:22:23,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:23,338 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:23,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:23,339 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-18 22:22:23,341 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-18 22:22:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:23,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 22:22:23,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:23,426 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-18 22:22:23,500 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-18 22:22:23,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:22:23,501 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:23,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977418385] [2021-12-18 22:22:23,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977418385] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:23,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:23,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 22:22:23,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596711686] [2021-12-18 22:22:23,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:23,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:22:23,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:23,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:22:23,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:22:23,505 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:23,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:23,661 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2021-12-18 22:22:23,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:22:23,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-18 22:22:23,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:23,665 INFO L225 Difference]: With dead ends: 61 [2021-12-18 22:22:23,665 INFO L226 Difference]: Without dead ends: 61 [2021-12-18 22:22:23,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:22:23,666 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:23,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:22:23,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-18 22:22:23,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2021-12-18 22:22:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-12-18 22:22:23,670 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2021-12-18 22:22:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:23,670 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-12-18 22:22:23,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-12-18 22:22:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 22:22:23,671 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:23,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:23,682 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-18 22:22:23,871 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-18 22:22:23,871 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:23,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:23,872 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2021-12-18 22:22:23,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:23,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449389104] [2021-12-18 22:22:23,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:23,873 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:23,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:23,874 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-18 22:22:23,876 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-18 22:22:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:23,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:22:23,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:22:23,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:22:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:22:24,066 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:24,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449389104] [2021-12-18 22:22:24,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449389104] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:22:24,066 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:22:24,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-18 22:22:24,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769395079] [2021-12-18 22:22:24,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:22:24,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 22:22:24,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:24,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 22:22:24,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:22:24,068 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:24,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:24,088 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2021-12-18 22:22:24,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 22:22:24,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-18 22:22:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:24,091 INFO L225 Difference]: With dead ends: 73 [2021-12-18 22:22:24,091 INFO L226 Difference]: Without dead ends: 73 [2021-12-18 22:22:24,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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-18 22:22:24,092 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 23 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:24,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 226 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:22:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-18 22:22:24,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2021-12-18 22:22:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.4) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2021-12-18 22:22:24,096 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2021-12-18 22:22:24,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:24,096 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2021-12-18 22:22:24,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2021-12-18 22:22:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 22:22:24,097 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:24,097 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:24,112 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-18 22:22:24,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:22:24,306 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:24,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:24,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2021-12-18 22:22:24,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:24,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293412900] [2021-12-18 22:22:24,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:22:24,307 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:24,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:24,308 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:22:24,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-18 22:22:24,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 22:22:24,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:22:24,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:22:24,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 22:22:24,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:22:24,430 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:24,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293412900] [2021-12-18 22:22:24,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293412900] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:24,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:24,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 22:22:24,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687630428] [2021-12-18 22:22:24,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:24,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:22:24,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:24,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:22:24,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:22:24,432 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:24,480 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2021-12-18 22:22:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 22:22:24,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 22:22:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:24,481 INFO L225 Difference]: With dead ends: 96 [2021-12-18 22:22:24,481 INFO L226 Difference]: Without dead ends: 96 [2021-12-18 22:22:24,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:22:24,482 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 111 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:24,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 155 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:22:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-18 22:22:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 68. [2021-12-18 22:22:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2021-12-18 22:22:24,486 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 26 [2021-12-18 22:22:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:24,486 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2021-12-18 22:22:24,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2021-12-18 22:22:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 22:22:24,489 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:24,489 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:24,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-18 22:22:24,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:22:24,698 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:24,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913225, now seen corresponding path program 1 times [2021-12-18 22:22:24,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:24,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680245054] [2021-12-18 22:22:24,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:24,699 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:24,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:24,700 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-18 22:22:24,700 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-18 22:22:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:24,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 22:22:24,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:24,834 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-18 22:22:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:22:24,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:22:24,923 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:24,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680245054] [2021-12-18 22:22:24,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680245054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:24,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:24,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 22:22:24,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581281469] [2021-12-18 22:22:24,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:24,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:22:24,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:24,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:22:24,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:22:24,924 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:25,317 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2021-12-18 22:22:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:22:25,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 22:22:25,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:25,318 INFO L225 Difference]: With dead ends: 87 [2021-12-18 22:22:25,318 INFO L226 Difference]: Without dead ends: 87 [2021-12-18 22:22:25,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:22:25,318 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 359 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:25,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 106 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 22:22:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-18 22:22:25,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 71. [2021-12-18 22:22:25,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 70 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2021-12-18 22:22:25,322 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 26 [2021-12-18 22:22:25,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:25,323 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2021-12-18 22:22:25,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2021-12-18 22:22:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 22:22:25,323 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:25,323 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:25,335 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-18 22:22:25,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:22:25,533 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:25,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:25,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913226, now seen corresponding path program 1 times [2021-12-18 22:22:25,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:25,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390151436] [2021-12-18 22:22:25,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:25,534 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:25,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:25,535 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:22:25,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-18 22:22:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:25,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-18 22:22:25,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:25,657 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-18 22:22:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:22:25,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:22:25,802 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:25,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390151436] [2021-12-18 22:22:25,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390151436] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:25,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:25,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 22:22:25,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064096430] [2021-12-18 22:22:25,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:25,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:22:25,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:25,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:22:25,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:22:25,803 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:26,273 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2021-12-18 22:22:26,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:22:26,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 22:22:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:26,275 INFO L225 Difference]: With dead ends: 107 [2021-12-18 22:22:26,275 INFO L226 Difference]: Without dead ends: 107 [2021-12-18 22:22:26,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:22:26,276 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 365 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:26,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 106 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 22:22:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-18 22:22:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2021-12-18 22:22:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.375) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2021-12-18 22:22:26,280 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 26 [2021-12-18 22:22:26,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:26,280 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2021-12-18 22:22:26,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:26,280 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2021-12-18 22:22:26,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-18 22:22:26,281 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:26,281 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:26,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-18 22:22:26,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:22:26,490 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:26,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2021-12-18 22:22:26,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:26,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889362048] [2021-12-18 22:22:26,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:26,490 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:26,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:26,491 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-18 22:22:26,492 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-18 22:22:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:26,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-18 22:22:26,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:26,642 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-18 22:22:26,717 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 22:22:26,717 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-18 22:22:26,806 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-18 22:22:26,981 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-18 22:22:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:22:27,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:22:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:22:27,320 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:27,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889362048] [2021-12-18 22:22:27,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889362048] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:22:27,321 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:22:27,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 20 [2021-12-18 22:22:27,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89632324] [2021-12-18 22:22:27,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:22:27,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-18 22:22:27,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:27,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-18 22:22:27,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-12-18 22:22:27,324 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:28,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:28,906 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2021-12-18 22:22:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 22:22:28,906 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-18 22:22:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:28,908 INFO L225 Difference]: With dead ends: 105 [2021-12-18 22:22:28,908 INFO L226 Difference]: Without dead ends: 105 [2021-12-18 22:22:28,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2021-12-18 22:22:28,910 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 541 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:28,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [541 Valid, 436 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-18 22:22:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-18 22:22:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2021-12-18 22:22:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2021-12-18 22:22:28,914 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 29 [2021-12-18 22:22:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:28,914 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2021-12-18 22:22:28,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2021-12-18 22:22:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-18 22:22:28,915 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:28,915 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:28,930 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-18 22:22:29,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:22:29,126 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:29,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:29,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687585, now seen corresponding path program 1 times [2021-12-18 22:22:29,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:29,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56816263] [2021-12-18 22:22:29,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:29,127 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:29,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:29,128 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:22:29,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-18 22:22:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:29,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-18 22:22:29,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:29,278 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-18 22:22:29,283 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-18 22:22:29,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:29,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 22:22:29,409 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:22:29,409 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 14 treesize of output 14 [2021-12-18 22:22:29,511 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-18 22:22:29,517 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-18 22:22:29,747 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-18 22:22:29,759 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-18 22:22:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:22:29,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:22:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:22:33,897 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:33,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56816263] [2021-12-18 22:22:33,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56816263] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:22:33,898 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:22:33,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2021-12-18 22:22:33,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571835733] [2021-12-18 22:22:33,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:22:33,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-18 22:22:33,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:33,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-18 22:22:33,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=687, Unknown=1, NotChecked=0, Total=756 [2021-12-18 22:22:33,899 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:37,876 INFO L93 Difference]: Finished difference Result 208 states and 224 transitions. [2021-12-18 22:22:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-18 22:22:37,877 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-18 22:22:37,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:37,877 INFO L225 Difference]: With dead ends: 208 [2021-12-18 22:22:37,878 INFO L226 Difference]: Without dead ends: 208 [2021-12-18 22:22:37,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=519, Invalid=2030, Unknown=1, NotChecked=0, Total=2550 [2021-12-18 22:22:37,879 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 1599 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:37,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1599 Valid, 584 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 615 Invalid, 0 Unknown, 165 Unchecked, 1.8s Time] [2021-12-18 22:22:37,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-18 22:22:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 84. [2021-12-18 22:22:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.391304347826087) internal successors, (96), 83 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2021-12-18 22:22:37,883 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 29 [2021-12-18 22:22:37,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:37,883 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2021-12-18 22:22:37,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2021-12-18 22:22:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-18 22:22:37,884 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:37,884 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:37,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-18 22:22:38,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:22:38,094 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:38,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:38,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1082686446, now seen corresponding path program 2 times [2021-12-18 22:22:38,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:38,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117174810] [2021-12-18 22:22:38,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:22:38,095 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:38,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:38,096 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-18 22:22:38,096 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-18 22:22:38,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:22:38,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:22:38,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:22:38,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 22:22:38,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:22:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 22:22:38,455 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:38,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117174810] [2021-12-18 22:22:38,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117174810] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:22:38,455 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:22:38,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-18 22:22:38,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976755188] [2021-12-18 22:22:38,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:22:38,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:22:38,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:38,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:22:38,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:22:38,456 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:38,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:38,769 INFO L93 Difference]: Finished difference Result 298 states and 326 transitions. [2021-12-18 22:22:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 22:22:38,770 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-18 22:22:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:38,772 INFO L225 Difference]: With dead ends: 298 [2021-12-18 22:22:38,772 INFO L226 Difference]: Without dead ends: 298 [2021-12-18 22:22:38,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2021-12-18 22:22:38,772 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 969 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:38,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [969 Valid, 268 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:22:38,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-12-18 22:22:38,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 92. [2021-12-18 22:22:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2021-12-18 22:22:38,781 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 32 [2021-12-18 22:22:38,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:38,782 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2021-12-18 22:22:38,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2021-12-18 22:22:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 22:22:38,785 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:38,785 INFO L514 BasicCegarLoop]: trace histogram [2, 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-18 22:22:38,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-18 22:22:38,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:22:38,996 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:38,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:38,997 INFO L85 PathProgramCache]: Analyzing trace with hash -516260032, now seen corresponding path program 1 times [2021-12-18 22:22:38,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:38,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569849650] [2021-12-18 22:22:38,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:38,998 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:38,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:38,999 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:22:39,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-18 22:22:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:39,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 22:22:39,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 22:22:39,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:22:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 22:22:39,318 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:39,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569849650] [2021-12-18 22:22:39,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569849650] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:22:39,318 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:22:39,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-18 22:22:39,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816366263] [2021-12-18 22:22:39,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:22:39,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 22:22:39,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:39,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 22:22:39,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:22:39,319 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:39,376 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2021-12-18 22:22:39,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:22:39,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-18 22:22:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:39,377 INFO L225 Difference]: With dead ends: 126 [2021-12-18 22:22:39,378 INFO L226 Difference]: Without dead ends: 126 [2021-12-18 22:22:39,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:22:39,379 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 302 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:39,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 177 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:22:39,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-18 22:22:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2021-12-18 22:22:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 100 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:39,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2021-12-18 22:22:39,382 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 36 [2021-12-18 22:22:39,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:39,382 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2021-12-18 22:22:39,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2021-12-18 22:22:39,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 22:22:39,383 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:39,383 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:39,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-18 22:22:39,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:22:39,594 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:39,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:39,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1215669110, now seen corresponding path program 1 times [2021-12-18 22:22:39,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:39,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415008379] [2021-12-18 22:22:39,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:39,595 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:39,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:39,599 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:22:39,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-18 22:22:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:39,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:22:39,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 22:22:39,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:22:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 22:22:39,950 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:39,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415008379] [2021-12-18 22:22:39,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415008379] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:22:39,950 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:22:39,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-18 22:22:39,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310701993] [2021-12-18 22:22:39,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:22:39,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:22:39,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:39,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:22:39,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:22:39,952 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:40,066 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2021-12-18 22:22:40,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 22:22:40,066 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-18 22:22:40,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:40,067 INFO L225 Difference]: With dead ends: 85 [2021-12-18 22:22:40,067 INFO L226 Difference]: Without dead ends: 85 [2021-12-18 22:22:40,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:22:40,068 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 273 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:40,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 197 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:22:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-18 22:22:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2021-12-18 22:22:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2021-12-18 22:22:40,078 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 37 [2021-12-18 22:22:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:40,079 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2021-12-18 22:22:40,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2021-12-18 22:22:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-18 22:22:40,083 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:40,083 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:40,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-18 22:22:40,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:22:40,294 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:40,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:40,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522148, now seen corresponding path program 2 times [2021-12-18 22:22:40,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:40,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954520280] [2021-12-18 22:22:40,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:22:40,295 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:40,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:40,312 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:22:40,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-18 22:22:40,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 22:22:40,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:22:40,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:22:40,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-18 22:22:40,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:22:40,583 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:40,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954520280] [2021-12-18 22:22:40,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954520280] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:40,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:40,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 22:22:40,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498878736] [2021-12-18 22:22:40,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:40,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:22:40,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:40,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:22:40,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:22:40,584 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:40,616 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2021-12-18 22:22:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 22:22:40,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-18 22:22:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:40,617 INFO L225 Difference]: With dead ends: 89 [2021-12-18 22:22:40,617 INFO L226 Difference]: Without dead ends: 89 [2021-12-18 22:22:40,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:22:40,618 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 82 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:40,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 140 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:22:40,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-18 22:22:40,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2021-12-18 22:22:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 78 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2021-12-18 22:22:40,620 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 41 [2021-12-18 22:22:40,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:40,620 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2021-12-18 22:22:40,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2021-12-18 22:22:40,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-18 22:22:40,621 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:40,621 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:40,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-18 22:22:40,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:22:40,830 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:40,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:40,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522203, now seen corresponding path program 1 times [2021-12-18 22:22:40,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:40,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152271272] [2021-12-18 22:22:40,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:40,831 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:40,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:40,832 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:22:40,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-18 22:22:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:40,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 22:22:40,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:40,973 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-18 22:22:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 22:22:41,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:22:41,065 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:41,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152271272] [2021-12-18 22:22:41,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152271272] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:41,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:41,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 22:22:41,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129039932] [2021-12-18 22:22:41,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:41,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:22:41,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:41,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:22:41,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:22:41,066 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:41,403 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2021-12-18 22:22:41,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:22:41,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-18 22:22:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:41,404 INFO L225 Difference]: With dead ends: 99 [2021-12-18 22:22:41,404 INFO L226 Difference]: Without dead ends: 99 [2021-12-18 22:22:41,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:22:41,405 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 311 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:41,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 111 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 22:22:41,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-18 22:22:41,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2021-12-18 22:22:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 82 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2021-12-18 22:22:41,409 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 41 [2021-12-18 22:22:41,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:41,409 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2021-12-18 22:22:41,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2021-12-18 22:22:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-18 22:22:41,410 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:41,410 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:41,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-18 22:22:41,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:22:41,615 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:41,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:41,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522204, now seen corresponding path program 1 times [2021-12-18 22:22:41,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:41,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208484643] [2021-12-18 22:22:41,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:41,616 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:41,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:41,617 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:22:41,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-18 22:22:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:41,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-18 22:22:41,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:41,806 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-18 22:22:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 22:22:42,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:22:42,016 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:42,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208484643] [2021-12-18 22:22:42,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208484643] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:42,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:42,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 22:22:42,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748081182] [2021-12-18 22:22:42,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:42,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:22:42,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:42,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:22:42,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:22:42,018 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:42,485 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2021-12-18 22:22:42,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:22:42,486 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-18 22:22:42,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:42,486 INFO L225 Difference]: With dead ends: 107 [2021-12-18 22:22:42,486 INFO L226 Difference]: Without dead ends: 107 [2021-12-18 22:22:42,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:22:42,487 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 413 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:42,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 80 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 22:22:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-18 22:22:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2021-12-18 22:22:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 82 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2021-12-18 22:22:42,489 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 41 [2021-12-18 22:22:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:42,490 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2021-12-18 22:22:42,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2021-12-18 22:22:42,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-18 22:22:42,490 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:42,490 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:42,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-18 22:22:42,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:22:42,700 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:42,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:42,701 INFO L85 PathProgramCache]: Analyzing trace with hash -333530929, now seen corresponding path program 1 times [2021-12-18 22:22:42,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:42,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350998448] [2021-12-18 22:22:42,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:42,714 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:42,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:42,715 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:22:42,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-18 22:22:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:42,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-18 22:22:42,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:42,968 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-18 22:22:42,969 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 21 [2021-12-18 22:22:43,091 INFO L354 Elim1Store]: treesize reduction 9, result has 64.0 percent of original size [2021-12-18 22:22:43,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 33 [2021-12-18 22:22:43,181 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 13 treesize of output 9 [2021-12-18 22:22:43,456 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:22:43,456 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 37 [2021-12-18 22:22:43,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:43,589 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 35 treesize of output 28 [2021-12-18 22:22:43,704 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 27 treesize of output 15 [2021-12-18 22:22:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:22:43,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:22:44,323 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-18 22:22:44,323 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 25 treesize of output 24 [2021-12-18 22:22:44,330 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_615) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) is different from false [2021-12-18 22:22:44,340 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_615) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base|)) is different from false [2021-12-18 22:22:44,348 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_update_at_~head#1.offset| (_ bv4 32))))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_615) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) .cse0))) is different from false [2021-12-18 22:22:44,360 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_615) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)))) is different from false [2021-12-18 22:22:44,366 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_create_#res#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_615) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse0)))) is different from false [2021-12-18 22:22:44,379 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_615) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) .cse0)))) is different from false [2021-12-18 22:22:44,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_615) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) .cse0)))) is different from false [2021-12-18 22:22:44,401 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:44,402 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-18 22:22:44,404 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 36 treesize of output 24 [2021-12-18 22:22:44,407 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 7 treesize of output 3 [2021-12-18 22:22:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2021-12-18 22:22:44,648 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:44,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350998448] [2021-12-18 22:22:44,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350998448] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:22:44,649 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:22:44,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2021-12-18 22:22:44,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140669292] [2021-12-18 22:22:44,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:22:44,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-18 22:22:44,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:44,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-18 22:22:44,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=919, Unknown=7, NotChecked=462, Total=1482 [2021-12-18 22:22:44,653 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 39 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:46,806 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2021-12-18 22:22:46,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-18 22:22:46,806 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 39 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-18 22:22:46,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:46,807 INFO L225 Difference]: With dead ends: 129 [2021-12-18 22:22:46,807 INFO L226 Difference]: Without dead ends: 129 [2021-12-18 22:22:46,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=306, Invalid=2165, Unknown=7, NotChecked=714, Total=3192 [2021-12-18 22:22:46,809 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 353 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 758 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:46,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 844 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 852 Invalid, 0 Unknown, 758 Unchecked, 1.1s Time] [2021-12-18 22:22:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-18 22:22:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 91. [2021-12-18 22:22:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2021-12-18 22:22:46,812 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 44 [2021-12-18 22:22:46,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:46,812 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2021-12-18 22:22:46,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 39 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:46,812 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2021-12-18 22:22:46,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-18 22:22:46,813 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:46,813 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:46,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-18 22:22:47,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:22:47,019 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:47,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:47,020 INFO L85 PathProgramCache]: Analyzing trace with hash -333530928, now seen corresponding path program 1 times [2021-12-18 22:22:47,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:47,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695935400] [2021-12-18 22:22:47,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:47,020 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:47,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:47,021 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:22:47,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-18 22:22:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:47,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 55 conjunts are in the unsatisfiable core [2021-12-18 22:22:47,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:47,226 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-18 22:22:47,230 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-18 22:22:47,381 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 22:22:47,382 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 18 [2021-12-18 22:22:47,396 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:22:47,397 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 14 treesize of output 14 [2021-12-18 22:22:47,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 22:22:47,557 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-18 22:22:47,930 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:22:47,930 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 46 treesize of output 45 [2021-12-18 22:22:47,936 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 24 [2021-12-18 22:22:48,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:48,007 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 21 treesize of output 20 [2021-12-18 22:22:48,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:48,017 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 33 treesize of output 26 [2021-12-18 22:22:48,161 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-18 22:22:48,167 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-18 22:22:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-18 22:22:48,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:22:49,293 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_677) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))))) (bvule .cse1 (bvadd .cse1 (_ bv4 32)))))) is different from false [2021-12-18 22:22:49,327 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_677) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2021-12-18 22:22:49,363 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_update_at_~head#1.offset| (_ bv4 32)))) (.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_677) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_update_at_~head#1.offset| (_ bv4 32))) v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))))) (bvule .cse2 (bvadd .cse2 (_ bv4 32)))))) is different from false [2021-12-18 22:22:49,419 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_677) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3)))) (bvule .cse2 (bvadd .cse2 (_ bv4 32)))))) is different from false [2021-12-18 22:22:49,450 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_create_#res#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_678) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_677) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1)))))) (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_sll_create_#res#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) v_ArrVal_678) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3)))) (bvule .cse2 (bvadd .cse2 (_ bv4 32)))))) is different from false [2021-12-18 22:22:49,480 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_678) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_677) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) v_ArrVal_678) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3)))) (bvule .cse2 (bvadd .cse2 (_ bv4 32)))))) is different from false [2021-12-18 22:22:49,539 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) v_ArrVal_678) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv4 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_678) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_677) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))))))) is different from false [2021-12-18 22:22:49,551 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:49,552 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2021-12-18 22:22:49,554 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 50 treesize of output 32 [2021-12-18 22:22:49,558 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 17 treesize of output 9 [2021-12-18 22:22:49,574 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:49,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2021-12-18 22:22:49,581 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:49,581 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-18 22:22:49,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:22:49,585 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 33 treesize of output 21 [2021-12-18 22:22:49,587 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:22:49,589 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 24 treesize of output 12 [2021-12-18 22:22:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2021-12-18 22:22:50,753 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:50,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695935400] [2021-12-18 22:22:50,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695935400] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:22:50,753 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:22:50,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 37 [2021-12-18 22:22:50,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448274175] [2021-12-18 22:22:50,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:22:50,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-18 22:22:50,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:50,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-18 22:22:50,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=858, Unknown=7, NotChecked=448, Total=1406 [2021-12-18 22:22:50,755 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 38 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:54,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:54,414 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2021-12-18 22:22:54,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-18 22:22:54,415 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 38 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-18 22:22:54,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:54,422 INFO L225 Difference]: With dead ends: 142 [2021-12-18 22:22:54,422 INFO L226 Difference]: Without dead ends: 142 [2021-12-18 22:22:54,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=252, Invalid=1839, Unknown=7, NotChecked=658, Total=2756 [2021-12-18 22:22:54,427 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 258 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 861 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:54,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 1133 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 642 Invalid, 0 Unknown, 861 Unchecked, 1.3s Time] [2021-12-18 22:22:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-18 22:22:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 90. [2021-12-18 22:22:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2021-12-18 22:22:54,446 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 44 [2021-12-18 22:22:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:54,446 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2021-12-18 22:22:54,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 38 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2021-12-18 22:22:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-18 22:22:54,447 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:54,447 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:54,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-18 22:22:54,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:22:54,660 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1958848316, now seen corresponding path program 2 times [2021-12-18 22:22:54,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:54,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478129633] [2021-12-18 22:22:54,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:22:54,661 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:54,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:54,662 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:22:54,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-18 22:22:54,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:22:54,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:22:54,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:22:54,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-18 22:22:54,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:22:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-18 22:22:55,152 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:55,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478129633] [2021-12-18 22:22:55,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478129633] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:22:55,152 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:22:55,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-18 22:22:55,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149933976] [2021-12-18 22:22:55,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:22:55,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:22:55,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:55,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:22:55,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:22:55,153 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:55,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:55,354 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2021-12-18 22:22:55,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 22:22:55,354 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-12-18 22:22:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:55,355 INFO L225 Difference]: With dead ends: 141 [2021-12-18 22:22:55,355 INFO L226 Difference]: Without dead ends: 141 [2021-12-18 22:22:55,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2021-12-18 22:22:55,356 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 211 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:55,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 342 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:22:55,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-18 22:22:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 89. [2021-12-18 22:22:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 88 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2021-12-18 22:22:55,358 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 47 [2021-12-18 22:22:55,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:55,359 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2021-12-18 22:22:55,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:55,359 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2021-12-18 22:22:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-18 22:22:55,359 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:55,359 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:55,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-18 22:22:55,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:22:55,563 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:22:55,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash -645325999, now seen corresponding path program 1 times [2021-12-18 22:22:55,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:22:55,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526376998] [2021-12-18 22:22:55,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:55,564 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:22:55,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:22:55,565 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:22:55,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-18 22:22:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:55,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-18 22:22:55,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:55,822 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-18 22:22:55,905 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:22:55,905 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 14 treesize of output 14 [2021-12-18 22:22:55,986 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 13 treesize of output 9 [2021-12-18 22:22:55,993 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-18 22:22:56,530 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:22:56,531 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 66 treesize of output 63 [2021-12-18 22:22:56,535 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 33 treesize of output 23 [2021-12-18 22:22:56,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:56,539 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 43 treesize of output 43 [2021-12-18 22:22:56,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:22:56,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:56,754 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2021-12-18 22:22:56,760 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 30 treesize of output 32 [2021-12-18 22:22:56,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:22:56,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:56,766 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2021-12-18 22:22:57,077 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 35 treesize of output 23 [2021-12-18 22:22:57,082 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 30 treesize of output 18 [2021-12-18 22:22:57,255 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 19 treesize of output 11 [2021-12-18 22:22:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:22:57,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:22:57,962 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32)) (v_ArrVal_799 (_ BitVec 32))) (= (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|) (bvadd (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_796) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_799)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_800)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (_ bv1 32)))) is different from false [2021-12-18 22:22:57,988 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32)) (v_ArrVal_799 (_ BitVec 32))) (= (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|) (bvadd (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_796) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) .cse0)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_800) .cse0))) (_ bv1 32)))) is different from false [2021-12-18 22:22:58,014 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:58,014 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2021-12-18 22:22:58,029 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:58,029 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 101 [2021-12-18 22:22:58,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 37 treesize of output 23 [2021-12-18 22:22:58,120 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (= (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|) (bvadd |c_ULTIMATE.start_sll_update_at_~data#1| (_ bv1 32))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_794) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_800) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_sll_update_at_~head#1.offset|))) is different from false [2021-12-18 22:22:58,161 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|) (bvadd |c_ULTIMATE.start_sll_update_at_~data#1| (_ bv1 32))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_794) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_800) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base|))) is different from false [2021-12-18 22:22:58,194 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|) (bvadd |c_ULTIMATE.start_sll_update_at_~data#1| (_ bv1 32))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_update_at_~head#1.offset| (_ bv4 32))))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) .cse0))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32))) (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_update_at_~head#1.offset| (_ bv4 32)))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) v_ArrVal_794) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_800) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1)))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_update_at_~head#1.offset| (_ bv4 32))) v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-18 22:22:58,245 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_794) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_800) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (= |c_ULTIMATE.start_main_~len~0#1| (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) .cse2) .cse1)))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (not (= (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) .cse3)) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-18 22:22:58,266 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32))) (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_create_#res#1.offset| (_ bv4 32)))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0) v_ArrVal_794) |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset| v_ArrVal_800) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0)))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (not (= (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_create_#res#1.offset| (_ bv4 32)))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) v_ArrVal_792) |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset| v_ArrVal_799) .cse1)) |c_ULTIMATE.start_sll_create_#res#1.base|))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (let ((.cse3 (bvadd |c_ULTIMATE.start_sll_create_#res#1.offset| (_ bv4 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_792) |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset| v_ArrVal_799) .cse3) .cse2))))) is different from false [2021-12-18 22:22:58,284 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_792) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_799) .cse1) .cse0)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32))) (let ((.cse2 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) v_ArrVal_794) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_800) .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (not (= (let ((.cse3 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) v_ArrVal_792) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_799) .cse3)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) is different from false [2021-12-18 22:22:58,319 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_792) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_799) .cse1) .cse0)))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (not (= (let ((.cse2 (bvadd |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv4 32)))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) v_ArrVal_792) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_799) .cse2)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32))) (let ((.cse3 (bvadd |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv4 32)))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3) v_ArrVal_794) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_800) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))))) is different from false [2021-12-18 22:22:58,329 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:58,330 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2021-12-18 22:22:58,331 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 42 treesize of output 38 [2021-12-18 22:22:58,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:22:58,336 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 11 treesize of output 7 [2021-12-18 22:22:58,338 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 38 treesize of output 30 [2021-12-18 22:22:58,363 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-18 22:22:58,363 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2021-12-18 22:22:58,372 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-18 22:22:58,372 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2021-12-18 22:22:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-18 22:22:58,829 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:22:58,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526376998] [2021-12-18 22:22:58,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526376998] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:22:58,829 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:22:58,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2021-12-18 22:22:58,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220587482] [2021-12-18 22:22:58,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:22:58,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-18 22:22:58,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:22:58,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-18 22:22:58,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1472, Unknown=9, NotChecked=756, Total=2352 [2021-12-18 22:22:58,831 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 49 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 49 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:23:01,833 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2021-12-18 22:23:01,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-18 22:23:01,834 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 49 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-18 22:23:01,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:23:01,834 INFO L225 Difference]: With dead ends: 89 [2021-12-18 22:23:01,834 INFO L226 Difference]: Without dead ends: 89 [2021-12-18 22:23:01,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=262, Invalid=2521, Unknown=9, NotChecked=990, Total=3782 [2021-12-18 22:23:01,836 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 52 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:23:01,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 1339 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 731 Invalid, 0 Unknown, 530 Unchecked, 1.2s Time] [2021-12-18 22:23:01,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-18 22:23:01,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-18 22:23:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2021-12-18 22:23:01,838 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 48 [2021-12-18 22:23:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:23:01,838 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2021-12-18 22:23:01,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 49 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2021-12-18 22:23:01,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-18 22:23:01,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:23:01,839 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-18 22:23:01,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-18 22:23:02,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:23:02,039 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:23:02,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:23:02,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1693462380, now seen corresponding path program 1 times [2021-12-18 22:23:02,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:23:02,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131392170] [2021-12-18 22:23:02,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:23:02,040 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:23:02,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:23:02,041 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:23:02,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-18 22:23:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:23:02,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-18 22:23:02,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:23:02,377 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 15 treesize of output 11 [2021-12-18 22:23:02,602 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-18 22:23:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-18 22:23:02,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:23:02,873 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 36 treesize of output 32 [2021-12-18 22:23:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-18 22:23:03,025 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:23:03,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131392170] [2021-12-18 22:23:03,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131392170] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:23:03,025 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:23:03,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2021-12-18 22:23:03,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014830084] [2021-12-18 22:23:03,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:23:03,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-18 22:23:03,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:23:03,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-18 22:23:03,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-12-18 22:23:03,027 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:23:03,709 INFO L93 Difference]: Finished difference Result 183 states and 197 transitions. [2021-12-18 22:23:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 22:23:03,711 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-12-18 22:23:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:23:03,712 INFO L225 Difference]: With dead ends: 183 [2021-12-18 22:23:03,712 INFO L226 Difference]: Without dead ends: 183 [2021-12-18 22:23:03,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2021-12-18 22:23:03,713 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 402 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:23:03,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 824 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 22:23:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-18 22:23:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 111. [2021-12-18 22:23:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 100 states have (on average 1.2) internal successors, (120), 110 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2021-12-18 22:23:03,716 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 55 [2021-12-18 22:23:03,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:23:03,716 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2021-12-18 22:23:03,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2021-12-18 22:23:03,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-18 22:23:03,717 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:23:03,717 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:23:03,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-18 22:23:03,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:23:03,919 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:23:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:23:03,920 INFO L85 PathProgramCache]: Analyzing trace with hash 261778123, now seen corresponding path program 2 times [2021-12-18 22:23:03,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:23:03,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301761009] [2021-12-18 22:23:03,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:23:03,920 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:23:03,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:23:03,921 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:23:03,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-18 22:23:04,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:23:04,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:23:04,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 22:23:04,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:23:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:23:04,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:23:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:23:04,361 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:23:04,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301761009] [2021-12-18 22:23:04,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301761009] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:23:04,362 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:23:04,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-18 22:23:04,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889941003] [2021-12-18 22:23:04,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:23:04,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:23:04,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:23:04,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:23:04,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:23:04,363 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:23:04,461 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-12-18 22:23:04,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:23:04,461 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-12-18 22:23:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:23:04,462 INFO L225 Difference]: With dead ends: 96 [2021-12-18 22:23:04,462 INFO L226 Difference]: Without dead ends: 96 [2021-12-18 22:23:04,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-12-18 22:23:04,462 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 134 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:23:04,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 195 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:23:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-18 22:23:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2021-12-18 22:23:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.125) internal successors, (99), 94 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2021-12-18 22:23:04,465 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 58 [2021-12-18 22:23:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:23:04,465 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2021-12-18 22:23:04,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:04,465 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2021-12-18 22:23:04,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-18 22:23:04,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:23:04,465 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-18 22:23:04,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-18 22:23:04,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:23:04,677 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:23:04,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:23:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash 187254194, now seen corresponding path program 1 times [2021-12-18 22:23:04,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:23:04,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971479236] [2021-12-18 22:23:04,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:23:04,679 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:23:04,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:23:04,680 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:23:04,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-18 22:23:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:23:05,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 22:23:05,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:23:05,080 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-18 22:23:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:23:05,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:23:05,292 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:23:05,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971479236] [2021-12-18 22:23:05,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971479236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:23:05,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:23:05,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 22:23:05,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098780558] [2021-12-18 22:23:05,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:23:05,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:23:05,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:23:05,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:23:05,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:23:05,295 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:23:05,735 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-12-18 22:23:05,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 22:23:05,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-18 22:23:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:23:05,736 INFO L225 Difference]: With dead ends: 106 [2021-12-18 22:23:05,736 INFO L226 Difference]: Without dead ends: 106 [2021-12-18 22:23:05,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:23:05,738 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 236 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 22:23:05,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 93 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 22:23:05,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-18 22:23:05,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2021-12-18 22:23:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 90 states have (on average 1.1333333333333333) internal successors, (102), 95 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2021-12-18 22:23:05,741 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 59 [2021-12-18 22:23:05,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:23:05,741 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2021-12-18 22:23:05,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:05,741 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2021-12-18 22:23:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-18 22:23:05,741 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:23:05,742 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-18 22:23:05,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-18 22:23:05,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:23:05,943 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:23:05,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:23:05,943 INFO L85 PathProgramCache]: Analyzing trace with hash 187254195, now seen corresponding path program 1 times [2021-12-18 22:23:05,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:23:05,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561541799] [2021-12-18 22:23:05,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:23:05,944 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:23:05,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:23:05,960 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:23:06,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-18 22:23:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:23:06,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-18 22:23:06,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:23:06,168 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-18 22:23:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:23:06,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:23:06,408 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:23:06,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561541799] [2021-12-18 22:23:06,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561541799] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:23:06,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:23:06,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 22:23:06,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331648142] [2021-12-18 22:23:06,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:23:06,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:23:06,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:23:06,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:23:06,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:23:06,409 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:23:06,869 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2021-12-18 22:23:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:23:06,870 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-18 22:23:06,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:23:06,870 INFO L225 Difference]: With dead ends: 104 [2021-12-18 22:23:06,871 INFO L226 Difference]: Without dead ends: 104 [2021-12-18 22:23:06,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:23:06,871 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 295 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 22:23:06,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 56 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 22:23:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-18 22:23:06,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2021-12-18 22:23:06,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2021-12-18 22:23:06,873 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 59 [2021-12-18 22:23:06,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:23:06,874 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2021-12-18 22:23:06,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2021-12-18 22:23:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-18 22:23:06,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:23:06,874 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-18 22:23:06,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-18 22:23:07,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:23:07,084 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:23:07,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:23:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1509911310, now seen corresponding path program 1 times [2021-12-18 22:23:07,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:23:07,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158555818] [2021-12-18 22:23:07,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:23:07,085 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:23:07,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:23:07,086 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:23:07,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-18 22:23:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:23:07,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 22:23:07,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:23:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 22:23:07,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:23:07,407 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:23:07,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158555818] [2021-12-18 22:23:07,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158555818] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:23:07,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:23:07,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 22:23:07,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589724077] [2021-12-18 22:23:07,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:23:07,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 22:23:07,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:23:07,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 22:23:07,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 22:23:07,409 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:07,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:23:07,672 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2021-12-18 22:23:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:23:07,672 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-12-18 22:23:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:23:07,672 INFO L225 Difference]: With dead ends: 101 [2021-12-18 22:23:07,673 INFO L226 Difference]: Without dead ends: 101 [2021-12-18 22:23:07,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:23:07,673 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 277 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:23:07,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 85 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 22:23:07,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-18 22:23:07,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2021-12-18 22:23:07,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 92 states have (on average 1.108695652173913) internal successors, (102), 97 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2021-12-18 22:23:07,676 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 60 [2021-12-18 22:23:07,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:23:07,676 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2021-12-18 22:23:07,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:07,676 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2021-12-18 22:23:07,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-18 22:23:07,677 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:23:07,677 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2021-12-18 22:23:07,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-18 22:23:07,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:23:07,883 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:23:07,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:23:07,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1058733960, now seen corresponding path program 3 times [2021-12-18 22:23:07,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:23:07,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898539764] [2021-12-18 22:23:07,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 22:23:07,884 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:23:07,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:23:07,885 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:23:07,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-18 22:23:08,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-18 22:23:08,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:23:08,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-18 22:23:08,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:23:08,168 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-18 22:23:08,594 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 27 treesize of output 15 [2021-12-18 22:23:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-18 22:23:08,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:23:09,428 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 36 treesize of output 32 [2021-12-18 22:23:09,506 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 36 treesize of output 32 [2021-12-18 22:23:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-18 22:23:09,818 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:23:09,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898539764] [2021-12-18 22:23:09,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898539764] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:23:09,818 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:23:09,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-12-18 22:23:09,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899615183] [2021-12-18 22:23:09,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:23:09,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-18 22:23:09,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:23:09,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-18 22:23:09,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-12-18 22:23:09,819 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:23:11,239 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-12-18 22:23:11,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 22:23:11,239 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-12-18 22:23:11,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:23:11,240 INFO L225 Difference]: With dead ends: 96 [2021-12-18 22:23:11,240 INFO L226 Difference]: Without dead ends: 96 [2021-12-18 22:23:11,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=208, Invalid=914, Unknown=0, NotChecked=0, Total=1122 [2021-12-18 22:23:11,241 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 223 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:23:11,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 283 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 22:23:11,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-18 22:23:11,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 74. [2021-12-18 22:23:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-12-18 22:23:11,244 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 60 [2021-12-18 22:23:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:23:11,244 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-12-18 22:23:11,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-12-18 22:23:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-18 22:23:11,245 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:23:11,245 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:23:11,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-12-18 22:23:11,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:23:11,451 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:23:11,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:23:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash -672727665, now seen corresponding path program 1 times [2021-12-18 22:23:11,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:23:11,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682372465] [2021-12-18 22:23:11,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:23:11,452 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:23:11,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:23:11,453 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:23:11,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-18 22:23:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:23:11,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-18 22:23:11,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:23:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-18 22:23:12,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:23:12,335 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:23:12,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682372465] [2021-12-18 22:23:12,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682372465] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:23:12,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:23:12,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 22:23:12,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153206506] [2021-12-18 22:23:12,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:23:12,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 22:23:12,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:23:12,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 22:23:12,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:23:12,336 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:23:12,502 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2021-12-18 22:23:12,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 22:23:12,503 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-18 22:23:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:23:12,503 INFO L225 Difference]: With dead ends: 75 [2021-12-18 22:23:12,503 INFO L226 Difference]: Without dead ends: 75 [2021-12-18 22:23:12,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-12-18 22:23:12,504 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 62 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:23:12,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 277 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 89 Unchecked, 0.0s Time] [2021-12-18 22:23:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-18 22:23:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-12-18 22:23:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-12-18 22:23:12,506 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2021-12-18 22:23:12,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:23:12,506 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-12-18 22:23:12,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-12-18 22:23:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-18 22:23:12,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:23:12,507 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:23:12,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-12-18 22:23:12,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:23:12,723 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:23:12,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:23:12,724 INFO L85 PathProgramCache]: Analyzing trace with hash -912303337, now seen corresponding path program 1 times [2021-12-18 22:23:12,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:23:12,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737984964] [2021-12-18 22:23:12,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:23:12,724 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:23:12,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:23:12,726 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:23:12,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-18 22:23:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:23:13,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-18 22:23:13,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:23:13,057 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-18 22:23:13,146 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 22:23:13,147 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-18 22:23:13,244 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 13 treesize of output 9 [2021-12-18 22:23:13,528 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:23:13,528 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 51 treesize of output 50 [2021-12-18 22:23:13,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:23:13,582 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 37 treesize of output 30 [2021-12-18 22:23:13,962 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 29 treesize of output 17 [2021-12-18 22:23:14,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 22:23:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-18 22:23:14,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:23:15,242 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:23:15,242 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-18 22:23:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2021-12-18 22:23:15,246 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 17 treesize of output 13 [2021-12-18 22:23:15,254 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:23:15,254 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-18 22:23:15,257 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 39 treesize of output 27 [2021-12-18 22:23:15,260 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 4 [2021-12-18 22:23:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-18 22:23:15,476 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:23:15,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737984964] [2021-12-18 22:23:15,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737984964] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:23:15,476 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:23:15,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2021-12-18 22:23:15,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094202899] [2021-12-18 22:23:15,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:23:15,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-18 22:23:15,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:23:15,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-18 22:23:15,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1088, Unknown=0, NotChecked=0, Total=1190 [2021-12-18 22:23:15,477 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 35 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:23:17,997 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2021-12-18 22:23:17,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-18 22:23:17,997 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 35 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-18 22:23:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:23:17,997 INFO L225 Difference]: With dead ends: 89 [2021-12-18 22:23:17,998 INFO L226 Difference]: Without dead ends: 89 [2021-12-18 22:23:17,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=381, Invalid=2589, Unknown=0, NotChecked=0, Total=2970 [2021-12-18 22:23:17,999 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 109 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 290 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:23:17,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 624 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 809 Invalid, 0 Unknown, 290 Unchecked, 1.2s Time] [2021-12-18 22:23:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-18 22:23:18,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2021-12-18 22:23:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2021-12-18 22:23:18,001 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 65 [2021-12-18 22:23:18,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:23:18,002 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2021-12-18 22:23:18,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 35 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2021-12-18 22:23:18,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-18 22:23:18,002 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:23:18,003 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:23:18,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2021-12-18 22:23:18,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:23:18,215 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:23:18,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:23:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash -912303336, now seen corresponding path program 1 times [2021-12-18 22:23:18,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:23:18,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831145193] [2021-12-18 22:23:18,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:23:18,217 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:23:18,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:23:18,218 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:23:18,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-18 22:23:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:23:18,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-18 22:23:18,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:23:18,514 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-18 22:23:18,519 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-18 22:23:18,641 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:23:18,642 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 14 treesize of output 14 [2021-12-18 22:23:18,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 22:23:18,754 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 13 treesize of output 9 [2021-12-18 22:23:18,760 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-18 22:23:19,260 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:23:19,261 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 46 treesize of output 45 [2021-12-18 22:23:19,268 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 24 [2021-12-18 22:23:19,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:23:19,343 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 33 treesize of output 26 [2021-12-18 22:23:19,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:23:19,367 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 21 treesize of output 20 [2021-12-18 22:23:19,657 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-18 22:23:19,660 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-18 22:23:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-18 22:23:19,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:23:20,993 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1298) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2021-12-18 22:23:21,024 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1298) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2021-12-18 22:23:21,049 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_update_at_~head#1.offset| (_ bv4 32)))) (.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1298) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_update_at_~head#1.offset| (_ bv4 32))) v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))) is different from false [2021-12-18 22:23:21,080 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1298) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3)))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))) is different from false [2021-12-18 22:23:21,101 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_create_#res#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) v_ArrVal_1299) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_sll_create_#res#1.offset| (_ bv4 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1299) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1298) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))))))) is different from false [2021-12-18 22:23:21,127 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_1299) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1299) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1298) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))))))) is different from false [2021-12-18 22:23:21,172 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1299) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1298) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3) v_ArrVal_1299) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3)))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))) is different from false [2021-12-18 22:23:21,192 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:23:21,193 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2021-12-18 22:23:21,200 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:23:21,200 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-18 22:23:21,204 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 62 treesize of output 50 [2021-12-18 22:23:21,206 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 96 treesize of output 78 [2021-12-18 22:23:21,213 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 40 treesize of output 32 [2021-12-18 22:23:21,215 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 66 treesize of output 58 [2021-12-18 22:23:21,297 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:23:21,297 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2021-12-18 22:23:21,313 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 54 treesize of output 36 [2021-12-18 22:23:21,320 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 19 treesize of output 11 [2021-12-18 22:23:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 9 not checked. [2021-12-18 22:23:22,625 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:23:22,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831145193] [2021-12-18 22:23:22,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831145193] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:23:22,625 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:23:22,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 39 [2021-12-18 22:23:22,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584165411] [2021-12-18 22:23:22,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:23:22,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-18 22:23:22,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:23:22,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-18 22:23:22,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=979, Unknown=7, NotChecked=476, Total=1560 [2021-12-18 22:23:22,627 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 40 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 40 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:23:26,800 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2021-12-18 22:23:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-18 22:23:26,801 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 40 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-18 22:23:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:23:26,803 INFO L225 Difference]: With dead ends: 93 [2021-12-18 22:23:26,803 INFO L226 Difference]: Without dead ends: 93 [2021-12-18 22:23:26,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 89 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=379, Invalid=2504, Unknown=7, NotChecked=770, Total=3660 [2021-12-18 22:23:26,805 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 136 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 774 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:23:26,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 463 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 700 Invalid, 0 Unknown, 774 Unchecked, 1.4s Time] [2021-12-18 22:23:26,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-18 22:23:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2021-12-18 22:23:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.12) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2021-12-18 22:23:26,808 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 65 [2021-12-18 22:23:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:23:26,808 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2021-12-18 22:23:26,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 40 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2021-12-18 22:23:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-18 22:23:26,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:23:26,809 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:23:26,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-12-18 22:23:27,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:23:27,015 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:23:27,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:23:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1783366217, now seen corresponding path program 1 times [2021-12-18 22:23:27,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:23:27,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881046015] [2021-12-18 22:23:27,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:23:27,016 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:23:27,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:23:27,017 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:23:27,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-18 22:23:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:23:27,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-18 22:23:27,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:23:27,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 22:23:27,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 22:23:27,521 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-18 22:23:27,522 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 20 treesize of output 20 [2021-12-18 22:23:27,615 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-18 22:23:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-18 22:23:27,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:23:27,820 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:23:27,820 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2021-12-18 22:23:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 22:23:27,980 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:23:27,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881046015] [2021-12-18 22:23:27,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881046015] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:23:27,981 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:23:27,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 21 [2021-12-18 22:23:27,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785458913] [2021-12-18 22:23:27,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:23:27,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-18 22:23:27,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:23:27,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-18 22:23:27,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-12-18 22:23:27,983 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 21 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:23:29,071 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-12-18 22:23:29,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-18 22:23:29,071 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 21 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-12-18 22:23:29,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:23:29,072 INFO L225 Difference]: With dead ends: 80 [2021-12-18 22:23:29,072 INFO L226 Difference]: Without dead ends: 80 [2021-12-18 22:23:29,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 106 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=379, Invalid=1103, Unknown=0, NotChecked=0, Total=1482 [2021-12-18 22:23:29,073 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 372 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 22:23:29,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 239 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 408 Invalid, 0 Unknown, 17 Unchecked, 0.6s Time] [2021-12-18 22:23:29,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-18 22:23:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-12-18 22:23:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2021-12-18 22:23:29,075 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 66 [2021-12-18 22:23:29,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:23:29,075 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2021-12-18 22:23:29,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 21 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2021-12-18 22:23:29,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-18 22:23:29,076 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:23:29,076 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-18 22:23:29,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-12-18 22:23:29,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:23:29,279 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:23:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:23:29,280 INFO L85 PathProgramCache]: Analyzing trace with hash 124432906, now seen corresponding path program 1 times [2021-12-18 22:23:29,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:23:29,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369129200] [2021-12-18 22:23:29,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:23:29,280 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:23:29,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:23:29,281 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:23:29,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-18 22:23:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:23:29,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-18 22:23:29,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:23:29,577 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 22:23:29,578 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 19 treesize of output 26 [2021-12-18 22:23:29,719 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-18 22:23:29,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 22:23:29,848 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-18 22:23:30,269 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:23:30,269 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 42 treesize of output 41 [2021-12-18 22:23:30,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:23:30,352 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 41 treesize of output 28 [2021-12-18 22:23:30,715 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 31 treesize of output 15 [2021-12-18 22:23:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-18 22:23:30,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:23:31,572 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_update_at_~head#1.offset| (_ bv4 32))) v_ArrVal_1415) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_#StackHeapBarrier|)) is different from false [2021-12-18 22:23:31,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1415) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2021-12-18 22:23:31,591 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_create_#res#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0) v_ArrVal_1415) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2021-12-18 22:23:31,606 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_1415) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2021-12-18 22:23:31,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1415) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2021-12-18 22:23:31,629 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:23:31,630 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-18 22:23:31,631 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 36 treesize of output 24 [2021-12-18 22:23:31,638 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 11 treesize of output 7 [2021-12-18 22:23:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 7 not checked. [2021-12-18 22:23:32,155 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:23:32,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369129200] [2021-12-18 22:23:32,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369129200] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:23:32,155 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:23:32,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 40 [2021-12-18 22:23:32,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925940526] [2021-12-18 22:23:32,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:23:32,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-18 22:23:32,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:23:32,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-18 22:23:32,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1132, Unknown=40, NotChecked=360, Total=1640 [2021-12-18 22:23:32,157 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 41 states, 40 states have (on average 2.925) internal successors, (117), 41 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:34,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:23:34,218 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2021-12-18 22:23:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-18 22:23:34,219 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.925) internal successors, (117), 41 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-12-18 22:23:34,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:23:34,219 INFO L225 Difference]: With dead ends: 82 [2021-12-18 22:23:34,219 INFO L226 Difference]: Without dead ends: 82 [2021-12-18 22:23:34,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=254, Invalid=2172, Unknown=44, NotChecked=500, Total=2970 [2021-12-18 22:23:34,220 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 59 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-18 22:23:34,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 638 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 558 Invalid, 0 Unknown, 507 Unchecked, 0.8s Time] [2021-12-18 22:23:34,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-18 22:23:34,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2021-12-18 22:23:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.105263157894737) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2021-12-18 22:23:34,222 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 68 [2021-12-18 22:23:34,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:23:34,222 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2021-12-18 22:23:34,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.925) internal successors, (117), 41 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:34,223 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2021-12-18 22:23:34,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-18 22:23:34,223 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:23:34,223 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:23:34,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-12-18 22:23:34,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:23:34,436 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:23:34,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:23:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash 424087740, now seen corresponding path program 2 times [2021-12-18 22:23:34,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:23:34,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145830458] [2021-12-18 22:23:34,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:23:34,437 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:23:34,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:23:34,438 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:23:34,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-12-18 22:23:34,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:23:34,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:23:34,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 84 conjunts are in the unsatisfiable core [2021-12-18 22:23:34,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:23:34,854 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-18 22:23:34,935 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-18 22:23:34,939 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-18 22:23:35,005 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:23:35,005 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 14 treesize of output 14 [2021-12-18 22:23:35,057 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 16 treesize of output 18 [2021-12-18 22:23:35,063 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 16 treesize of output 18 [2021-12-18 22:23:35,075 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 16 treesize of output 18 [2021-12-18 22:23:35,097 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 16 treesize of output 18 [2021-12-18 22:23:35,177 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 21 treesize of output 20 [2021-12-18 22:23:35,180 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 27 treesize of output 26 [2021-12-18 22:23:35,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:23:35,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:23:35,637 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 22:23:35,638 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 1 case distinctions, treesize of input 95 treesize of output 64 [2021-12-18 22:23:35,651 INFO L354 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-18 22:23:35,651 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 1 case distinctions, treesize of input 52 treesize of output 45 [2021-12-18 22:23:35,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:23:35,731 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:23:35,734 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 22:23:35,734 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 1 case distinctions, treesize of input 48 treesize of output 41 [2021-12-18 22:23:35,738 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-12-18 22:23:35,740 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 7 treesize of output 3 [2021-12-18 22:23:36,478 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-12-18 22:23:36,479 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 38 [2021-12-18 22:23:36,487 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:23:36,487 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-12-18 22:23:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 22:23:36,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:23:37,504 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1489 (_ BitVec 32))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1490) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (not (= .cse0 (_ bv0 32))) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1489)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (bvadd .cse0 (_ bv4 32))) (_ bv0 32)))))) (forall ((v_ArrVal_1490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1489 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1490)) (.cse4 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse5 (select (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) .cse4))) (or (= (_ bv0 32) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1489)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse4)) (bvadd .cse5 (_ bv4 32)))) (not (= (_ bv0 32) .cse5))))))) is different from false [2021-12-18 22:23:37,542 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 39 treesize of output 31 [2021-12-18 22:23:55,246 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:23:55,246 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 96 treesize of output 75 [2021-12-18 22:23:55,279 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:23:55,280 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 73 treesize of output 72 [2021-12-18 22:23:55,293 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:23:55,293 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 63 treesize of output 62 [2021-12-18 22:24:08,945 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:24:08,945 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 231 [2021-12-18 22:24:08,973 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:24:08,974 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 161 [2021-12-18 22:24:09,025 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:24:09,026 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 2093 treesize of output 2020 [2021-12-18 22:24:09,242 INFO L354 Elim1Store]: treesize reduction 29, result has 67.0 percent of original size [2021-12-18 22:24:09,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 8427 treesize of output 8155 [2021-12-18 22:24:09,373 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 8160 treesize of output 7792 [2021-12-18 22:24:09,470 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:24:09,471 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 7723 treesize of output 7608 [2021-12-18 22:24:09,628 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:24:09,629 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 7603 treesize of output 7594 [2021-12-18 22:24:09,720 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 7252 treesize of output 6670 [2021-12-18 22:24:09,865 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:24:09,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145830458] [2021-12-18 22:24:09,865 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-18 22:24:09,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1694085527] [2021-12-18 22:24:09,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:24:09,866 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 22:24:09,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 22:24:09,875 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 22:24:09,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2021-12-18 22:24:10,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:24:10,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:24:10,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-18 22:24:10,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:24:10,279 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-18 22:24:10,353 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-18 22:24:10,358 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-18 22:24:10,404 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:24:10,404 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 14 treesize of output 14 [2021-12-18 22:24:10,432 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 16 treesize of output 18 [2021-12-18 22:24:10,439 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 16 treesize of output 18 [2021-12-18 22:24:10,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 22:24:10,465 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 16 treesize of output 18 [2021-12-18 22:24:10,524 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 21 treesize of output 20 [2021-12-18 22:24:10,527 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 27 treesize of output 26 [2021-12-18 22:24:10,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:24:10,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:24:10,745 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 22:24:10,746 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 1 case distinctions, treesize of input 95 treesize of output 64 [2021-12-18 22:24:10,760 INFO L354 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-18 22:24:10,760 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 1 case distinctions, treesize of input 52 treesize of output 45 [2021-12-18 22:24:10,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:24:10,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:24:10,848 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 22:24:10,848 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 1 case distinctions, treesize of input 48 treesize of output 41 [2021-12-18 22:24:10,851 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-12-18 22:24:10,854 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 7 treesize of output 3 [2021-12-18 22:24:11,829 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-18 22:24:12,132 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-12-18 22:24:12,132 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 45 [2021-12-18 22:24:12,152 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:24:12,152 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-18 22:24:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 22:24:12,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:24:12,675 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 24 treesize of output 22 [2021-12-18 22:25:24,079 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:25:24,079 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 123 treesize of output 122 [2021-12-18 22:25:24,088 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:25:24,088 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 155 treesize of output 123 [2021-12-18 22:25:24,136 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 4 [2021-12-18 22:25:24,341 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 4 [2021-12-18 22:25: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 8 treesize of output 4 [2021-12-18 22:25:25,596 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:25:25,596 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 123 treesize of output 122 [2021-12-18 22:25:25,612 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:25:25,613 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 155 treesize of output 123 [2021-12-18 22:25:25,629 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 4 [2021-12-18 22:25:25,828 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 4 [2021-12-18 22:25:26,190 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 4 [2021-12-18 22:25:29,139 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1560 (_ BitVec 32)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_43| (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1560))))) (let ((.cse0 (select (select .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32)))) (or (= .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|))) (and (forall ((v_ArrVal_1559 (_ BitVec 32))) (= (_ bv0 32) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1559))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1560))) |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32))) (_ bv4 32)))) (= (select (select .cse3 .cse0) (_ bv4 32)) (_ bv0 32))))))) is different from false [2021-12-18 22:25:31,433 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1560 (_ BitVec 32)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_43| (_ BitVec 32))) (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_1560))))) (let ((.cse0 (select (select .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32)))) (or (= .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|))) (and (= (select (select .cse1 .cse0) (_ bv4 32)) (_ bv0 32)) (forall ((v_ArrVal_1559 (_ BitVec 32))) (= (_ bv0 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_1559))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_1560))) |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32))) (_ bv4 32))))))))) is different from false [2021-12-18 22:25:31,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:25:31,467 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 1402 treesize of output 1258 [2021-12-18 22:25:31,542 INFO L354 Elim1Store]: treesize reduction 66, result has 38.3 percent of original size [2021-12-18 22:25:31,543 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 3 case distinctions, treesize of input 1045 treesize of output 1041 [2021-12-18 22:25:31,618 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:25:31,619 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 759 treesize of output 775 [2021-12-18 22:25:31,650 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 6 treesize of output 4 [2021-12-18 22:25:32,011 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:25:32,011 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 15 treesize of output 9 [2021-12-18 22:25:32,033 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 4 [2021-12-18 22:25:32,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:25:32,094 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2021-12-18 22:25:32,120 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 4 [2021-12-18 22:25:32,204 INFO L354 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2021-12-18 22:25:32,205 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 51 treesize of output 47 [2021-12-18 22:25:32,368 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:25:32,368 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 120 treesize of output 108 [2021-12-18 22:25:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 4 not checked. [2021-12-18 22:25:33,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1694085527] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:25:33,612 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:25:33,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 50 [2021-12-18 22:25:33,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519013148] [2021-12-18 22:25:33,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:25:33,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-18 22:25:33,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:25:33,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-18 22:25:33,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=4574, Unknown=307, NotChecked=426, Total=5550 [2021-12-18 22:25:33,615 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:27:56,435 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (.cse6 (bvadd |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (_ bv1 1))) (forall ((v_ArrVal_1560 (_ BitVec 32)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_43| (_ BitVec 32))) (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1560))))) (let ((.cse1 (select (select .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32)))) (or (= .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|))) (and (forall ((v_ArrVal_1559 (_ BitVec 32))) (= (_ bv0 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1559))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1560))) |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32))) (_ bv4 32)))) (= (select (select .cse4 .cse1) (_ bv4 32)) (_ bv0 32))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse6) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse6) (_ bv0 32)) (forall ((v_ArrVal_1560 (_ BitVec 32))) (let ((.cse12 (bvadd |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv4 32)))) (let ((.cse8 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse13 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1560))))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse12))) (or (= .cse7 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (and (= (select (select .cse8 .cse7) (_ bv4 32)) (_ bv0 32)) (forall ((v_ArrVal_1559 (_ BitVec 32))) (= (_ bv0 32) (select (let ((.cse10 (bvadd |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv4 32)))) (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1559))) (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1560))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10))) (_ bv4 32)))))))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (_ bv1 1))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv0 32)))) is different from false [2021-12-18 22:28:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:28:05,000 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2021-12-18 22:28:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-18 22:28:05,001 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-12-18 22:28:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:28:05,001 INFO L225 Difference]: With dead ends: 144 [2021-12-18 22:28:05,001 INFO L226 Difference]: Without dead ends: 144 [2021-12-18 22:28:05,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 193 SyntacticMatches, 10 SemanticMatches, 95 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 257.6s TimeCoverageRelationStatistics Valid=613, Invalid=7550, Unknown=409, NotChecked=740, Total=9312 [2021-12-18 22:28:05,003 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 203 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 731 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:28:05,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 1295 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 879 Invalid, 0 Unknown, 731 Unchecked, 2.1s Time] [2021-12-18 22:28:05,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-18 22:28:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 139. [2021-12-18 22:28:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 138 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:28:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2021-12-18 22:28:05,007 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 71 [2021-12-18 22:28:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:28:05,007 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2021-12-18 22:28:05,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:28:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2021-12-18 22:28:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-18 22:28:05,008 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:28:05,008 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-18 22:28:05,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-12-18 22:28:05,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2021-12-18 22:28:05,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-18 22:28:05,409 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:28:05,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:28:05,409 INFO L85 PathProgramCache]: Analyzing trace with hash 261816644, now seen corresponding path program 2 times [2021-12-18 22:28:05,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:28:05,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846125177] [2021-12-18 22:28:05,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:28:05,410 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:28:05,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:28:05,410 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:28:05,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-12-18 22:28:05,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:28:05,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:28:05,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-18 22:28:05,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:28:06,345 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-18 22:28:07,241 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:28:07,241 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 53 treesize of output 52 [2021-12-18 22:28:07,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:28:07,530 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 52 treesize of output 39 [2021-12-18 22:28:08,308 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 42 treesize of output 26 [2021-12-18 22:28:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-18 22:28:11,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:28:14,432 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (_ BitVec 1)) (v_ArrVal_1628 (_ BitVec 1)) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg v_ArrVal_1629))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1628) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1625) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) v_ArrVal_1629) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (bvneg v_ArrVal_1628))))) is different from false [2021-12-18 22:28:14,550 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (_ BitVec 1)) (v_ArrVal_1628 (_ BitVec 1)) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg v_ArrVal_1629))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1628) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1625) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) v_ArrVal_1629) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (bvneg v_ArrVal_1628))))) is different from false [2021-12-18 22:28:14,631 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (_ BitVec 1)) (v_ArrVal_1628 (_ BitVec 1)) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1628) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_update_at_~head#1.offset| (_ bv4 32))) v_ArrVal_1625) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) v_ArrVal_1629) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (bvneg v_ArrVal_1629))) (not (= (_ bv0 1) (bvneg v_ArrVal_1628))))) is different from false [2021-12-18 22:28:14,961 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (_ BitVec 1)) (v_ArrVal_1628 (_ BitVec 1)) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg v_ArrVal_1629))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1628) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1625) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) v_ArrVal_1629) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (bvneg v_ArrVal_1628))))) is different from false [2021-12-18 22:28:15,013 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (_ BitVec 1)) (v_ArrVal_1628 (_ BitVec 1)) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1628) (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_create_#res#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0) v_ArrVal_1625) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0)) v_ArrVal_1629) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (bvneg v_ArrVal_1629))) (not (= (_ bv0 1) (bvneg v_ArrVal_1628))))) is different from false [2021-12-18 22:28:15,089 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (_ BitVec 1)) (v_ArrVal_1628 (_ BitVec 1)) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1628) (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_1625) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0)) v_ArrVal_1629) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (bvneg v_ArrVal_1629))) (not (= (_ bv0 1) (bvneg v_ArrVal_1628))))) is different from false [2021-12-18 22:28:15,268 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (_ BitVec 1)) (v_ArrVal_1628 (_ BitVec 1)) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg v_ArrVal_1629))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1628) (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1625) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) v_ArrVal_1629) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (bvneg v_ArrVal_1628))))) is different from false [2021-12-18 22:28:15,282 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:28:15,282 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-18 22:28:15,286 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 56 treesize of output 44 [2021-12-18 22:28:15,292 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 21 treesize of output 17 [2021-12-18 22:29:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 10 not checked. [2021-12-18 22:29:31,217 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:29:31,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846125177] [2021-12-18 22:29:31,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846125177] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:29:31,217 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:29:31,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 44 [2021-12-18 22:29:31,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309439242] [2021-12-18 22:29:31,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:29:31,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-18 22:29:31,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:29:31,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-18 22:29:31,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1283, Unknown=35, NotChecked=546, Total=1980 [2021-12-18 22:29:31,219 INFO L87 Difference]: Start difference. First operand 139 states and 145 transitions. Second operand has 45 states, 44 states have (on average 2.840909090909091) internal successors, (125), 45 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:29:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:29:32,060 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2021-12-18 22:29:32,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-18 22:29:32,061 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.840909090909091) internal successors, (125), 45 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-12-18 22:29:32,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:29:32,062 INFO L225 Difference]: With dead ends: 141 [2021-12-18 22:29:32,062 INFO L226 Difference]: Without dead ends: 90 [2021-12-18 22:29:32,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 97 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 66.6s TimeCoverageRelationStatistics Valid=140, Invalid=1659, Unknown=35, NotChecked=616, Total=2450 [2021-12-18 22:29:32,063 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 338 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:29:32,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 757 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 338 Unchecked, 0.0s Time] [2021-12-18 22:29:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-18 22:29:32,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-12-18 22:29:32,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 89 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:29:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2021-12-18 22:29:32,065 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 72 [2021-12-18 22:29:32,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:29:32,065 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2021-12-18 22:29:32,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.840909090909091) internal successors, (125), 45 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:29:32,066 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2021-12-18 22:29:32,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-18 22:29:32,066 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:29:32,066 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:29:32,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2021-12-18 22:29:32,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:29:32,281 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 22:29:32,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:29:32,281 INFO L85 PathProgramCache]: Analyzing trace with hash 683637232, now seen corresponding path program 3 times [2021-12-18 22:29:32,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 22:29:32,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522507517] [2021-12-18 22:29:32,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 22:29:32,282 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 22:29:32,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 22:29:32,283 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 22:29:32,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-12-18 22:29:32,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-18 22:29:32,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:29:32,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 22:29:32,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:29:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-18 22:29:32,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:29:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-18 22:29:33,271 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 22:29:33,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522507517] [2021-12-18 22:29:33,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522507517] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:29:33,271 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 22:29:33,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2021-12-18 22:29:33,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992111369] [2021-12-18 22:29:33,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 22:29:33,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:29:33,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 22:29:33,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:29:33,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:29:33,272 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:29:33,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:29:33,310 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2021-12-18 22:29:33,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 22:29:33,311 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-12-18 22:29:33,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:29:33,311 INFO L225 Difference]: With dead ends: 21 [2021-12-18 22:29:33,311 INFO L226 Difference]: Without dead ends: 0 [2021-12-18 22:29:33,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:29:33,311 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:29:33,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 63 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:29:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-18 22:29:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-18 22:29:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:29:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-18 22:29:33,313 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2021-12-18 22:29:33,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:29:33,313 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-18 22:29:33,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:29:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-18 22:29:33,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-18 22:29:33,315 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION (20 of 21 remaining) [2021-12-18 22:29:33,315 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION (19 of 21 remaining) [2021-12-18 22:29:33,315 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION (18 of 21 remaining) [2021-12-18 22:29:33,315 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION (17 of 21 remaining) [2021-12-18 22:29:33,315 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATION (16 of 21 remaining) [2021-12-18 22:29:33,315 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION (15 of 21 remaining) [2021-12-18 22:29:33,316 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATION (14 of 21 remaining) [2021-12-18 22:29:33,316 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION (13 of 21 remaining) [2021-12-18 22:29:33,316 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATION (12 of 21 remaining) [2021-12-18 22:29:33,316 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATION (11 of 21 remaining) [2021-12-18 22:29:33,316 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATION (10 of 21 remaining) [2021-12-18 22:29:33,316 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATION (9 of 21 remaining) [2021-12-18 22:29:33,316 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATION (8 of 21 remaining) [2021-12-18 22:29:33,316 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATION (7 of 21 remaining) [2021-12-18 22:29:33,316 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATION (6 of 21 remaining) [2021-12-18 22:29:33,316 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATION (5 of 21 remaining) [2021-12-18 22:29:33,317 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2021-12-18 22:29:33,317 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2021-12-18 22:29:33,317 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2021-12-18 22:29:33,317 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (1 of 21 remaining) [2021-12-18 22:29:33,317 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2021-12-18 22:29:33,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2021-12-18 22:29:33,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 22:29:33,520 INFO L732 BasicCegarLoop]: Path program histogram: [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, 1] [2021-12-18 22:29:33,521 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 22:29:33,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:29:33 BoogieIcfgContainer [2021-12-18 22:29:33,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 22:29:33,523 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 22:29:33,524 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 22:29:33,524 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 22:29:33,524 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:22:21" (3/4) ... [2021-12-18 22:29:33,526 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-18 22:29:33,535 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2021-12-18 22:29:33,536 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-12-18 22:29:33,536 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-18 22:29:33,536 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-18 22:29:33,567 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-18 22:29:33,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 22:29:33,568 INFO L158 Benchmark]: Toolchain (without parser) took 433273.74ms. Allocated memory was 52.4MB in the beginning and 109.1MB in the end (delta: 56.6MB). Free memory was 28.2MB in the beginning and 26.9MB in the end (delta: 1.3MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2021-12-18 22:29:33,568 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 22.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 22:29:33,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.94ms. Allocated memory was 52.4MB in the beginning and 73.4MB in the end (delta: 21.0MB). Free memory was 27.9MB in the beginning and 48.0MB in the end (delta: -20.1MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2021-12-18 22:29:33,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.01ms. Allocated memory is still 73.4MB. Free memory was 47.8MB in the beginning and 45.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 22:29:33,569 INFO L158 Benchmark]: Boogie Preprocessor took 24.46ms. Allocated memory is still 73.4MB. Free memory was 45.6MB in the beginning and 43.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 22:29:33,569 INFO L158 Benchmark]: RCFGBuilder took 554.65ms. Allocated memory is still 73.4MB. Free memory was 43.7MB in the beginning and 46.5MB in the end (delta: -2.8MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2021-12-18 22:29:33,569 INFO L158 Benchmark]: TraceAbstraction took 432260.39ms. Allocated memory was 73.4MB in the beginning and 109.1MB in the end (delta: 35.7MB). Free memory was 46.3MB in the beginning and 31.1MB in the end (delta: 15.2MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2021-12-18 22:29:33,569 INFO L158 Benchmark]: Witness Printer took 44.03ms. Allocated memory is still 109.1MB. Free memory was 30.0MB in the beginning and 26.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 22:29:33,570 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.17ms. Allocated memory is still 52.4MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 22.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.94ms. Allocated memory was 52.4MB in the beginning and 73.4MB in the end (delta: 21.0MB). Free memory was 27.9MB in the beginning and 48.0MB in the end (delta: -20.1MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.01ms. Allocated memory is still 73.4MB. Free memory was 47.8MB in the beginning and 45.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.46ms. Allocated memory is still 73.4MB. Free memory was 45.6MB in the beginning and 43.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 554.65ms. Allocated memory is still 73.4MB. Free memory was 43.7MB in the beginning and 46.5MB in the end (delta: -2.8MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * TraceAbstraction took 432260.39ms. Allocated memory was 73.4MB in the beginning and 109.1MB in the end (delta: 35.7MB). Free memory was 46.3MB in the beginning and 31.1MB in the end (delta: 15.2MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. * Witness Printer took 44.03ms. Allocated memory is still 109.1MB. Free memory was 30.0MB in the beginning and 26.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 601]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 601]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 630]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 613]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 432.2s, OverallIterations: 35, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 183.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9222 SdHoareTripleChecker+Valid, 16.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9222 mSDsluCounter, 12634 SdHoareTripleChecker+Invalid, 14.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5060 IncrementalHoareTripleChecker+Unchecked, 11011 mSDsCounter, 601 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8837 IncrementalHoareTripleChecker+Invalid, 14498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 601 mSolverCounterUnsat, 1623 mSDtfsCounter, 8837 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2949 GetRequests, 2013 SyntacticMatches, 54 SemanticMatches, 882 ConstructedPredicates, 46 IntricatePredicates, 4 DeprecatedPredicates, 5900 ImplicationChecksByTransitivity, 357.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=33, InterpolantAutomatonStates: 487, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 939 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 234.7s InterpolantComputationTime, 1571 NumberOfCodeBlocks, 1517 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2538 ConstructedInterpolants, 359 QuantifiedInterpolants, 41852 SizeOfPredicates, 605 NumberOfNonLiveVariables, 7176 ConjunctsInSsa, 864 ConjunctsInUnsatCore, 56 InterpolantComputations, 15 PerfectInterpolantSequences, 858/1334 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-12-18 22:29:33,710 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE