./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 839c364b 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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:51:39,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:51:39,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:51:39,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:51:39,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:51:39,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:51:39,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:51:39,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:51:39,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:51:39,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:51:39,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:51:39,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:51:39,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:51:39,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:51:39,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:51:39,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:51:39,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:51:39,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:51:39,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:51:39,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:51:39,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:51:39,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:51:39,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:51:39,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:51:39,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:51:39,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:51:39,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:51:39,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:51:39,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:51:39,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:51:39,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:51:39,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:51:39,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:51:39,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:51:39,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:51:39,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:51:40,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:51:40,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:51:40,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:51:40,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:51:40,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:51:40,002 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:51:40,021 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:51:40,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:51:40,022 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:51:40,022 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:51:40,023 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:51:40,023 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:51:40,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:51:40,023 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:51:40,024 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:51:40,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:51:40,024 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:51:40,025 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:51:40,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:51:40,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:51:40,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:51:40,025 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:51:40,025 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:51:40,025 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:51:40,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:51:40,026 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:51:40,026 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:51:40,026 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:51:40,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:51:40,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:51:40,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:51:40,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:51:40,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:51:40,028 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:51:40,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:51:40,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:51:40,028 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:51:40,028 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-14 19:51:40,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:51:40,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:51:40,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:51:40,240 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:51:40,240 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:51:40,241 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-14 19:51:40,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57084f1a6/3fcfed183d604f07b9ddea5d89648bac/FLAG83e8164e3 [2021-12-14 19:51:40,720 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:51:40,721 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-12-14 19:51:40,728 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57084f1a6/3fcfed183d604f07b9ddea5d89648bac/FLAG83e8164e3 [2021-12-14 19:51:41,092 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57084f1a6/3fcfed183d604f07b9ddea5d89648bac [2021-12-14 19:51:41,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:51:41,095 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:51:41,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:51:41,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:51:41,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:51:41,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:51:41" (1/1) ... [2021-12-14 19:51:41,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592de163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:41, skipping insertion in model container [2021-12-14 19:51:41,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:51:41" (1/1) ... [2021-12-14 19:51:41,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:51:41,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:51:41,363 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-14 19:51:41,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:51:41,369 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:51:41,392 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-14 19:51:41,393 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:51:41,410 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:51:41,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:41 WrapperNode [2021-12-14 19:51:41,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:51:41,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:51:41,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:51:41,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:51:41,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:41" (1/1) ... [2021-12-14 19:51:41,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:41" (1/1) ... [2021-12-14 19:51:41,445 INFO L137 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2021-12-14 19:51:41,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:51:41,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:51:41,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:51:41,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:51:41,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:41" (1/1) ... [2021-12-14 19:51:41,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:41" (1/1) ... [2021-12-14 19:51:41,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:41" (1/1) ... [2021-12-14 19:51:41,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:41" (1/1) ... [2021-12-14 19:51:41,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:41" (1/1) ... [2021-12-14 19:51:41,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:41" (1/1) ... [2021-12-14 19:51:41,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:41" (1/1) ... [2021-12-14 19:51:41,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:51:41,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:51:41,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:51:41,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:51:41,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:41" (1/1) ... [2021-12-14 19:51:41,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:51:41,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:41,513 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-14 19:51:41,520 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-14 19:51:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:51:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:51:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:51:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:51:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:51:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:51:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:51:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:51:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:51:41,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:51:41,604 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:51:41,605 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:51:41,808 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:51:41,812 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:51:41,813 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-14 19:51:41,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:51:41 BoogieIcfgContainer [2021-12-14 19:51:41,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:51:41,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:51:41,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:51:41,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:51:41,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:51:41" (1/3) ... [2021-12-14 19:51:41,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab15c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:51:41, skipping insertion in model container [2021-12-14 19:51:41,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:41" (2/3) ... [2021-12-14 19:51:41,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab15c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:51:41, skipping insertion in model container [2021-12-14 19:51:41,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:51:41" (3/3) ... [2021-12-14 19:51:41,820 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2021-12-14 19:51:41,823 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:51:41,823 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-12-14 19:51:41,854 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:51:41,861 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-14 19:51:41,861 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-12-14 19:51:41,871 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-14 19:51:41,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:51:41,875 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:41,875 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:51:41,875 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-14 19:51:41,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:41,879 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2021-12-14 19:51:41,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:41,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17465705] [2021-12-14 19:51:41,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:41,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:42,003 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-14 19:51:42,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:42,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17465705] [2021-12-14 19:51:42,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17465705] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:42,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:42,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:51:42,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872693183] [2021-12-14 19:51:42,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:42,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:51:42,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:42,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:51:42,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:51:42,028 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-14 19:51:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:42,089 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2021-12-14 19:51:42,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:51:42,091 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-14 19:51:42,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:42,097 INFO L225 Difference]: With dead ends: 109 [2021-12-14 19:51:42,097 INFO L226 Difference]: Without dead ends: 104 [2021-12-14 19:51:42,098 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-14 19:51:42,100 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:42,101 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.0s Time] [2021-12-14 19:51:42,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-14 19:51:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2021-12-14 19:51:42,123 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-14 19:51:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2021-12-14 19:51:42,124 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2021-12-14 19:51:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:42,125 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2021-12-14 19:51:42,125 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-14 19:51:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2021-12-14 19:51:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:51:42,125 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:42,126 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:51:42,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:51:42,126 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-14 19:51:42,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:42,127 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2021-12-14 19:51:42,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:42,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253197597] [2021-12-14 19:51:42,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:42,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:42,162 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-14 19:51:42,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:42,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253197597] [2021-12-14 19:51:42,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253197597] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:42,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:42,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:51:42,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603294018] [2021-12-14 19:51:42,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:42,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:51:42,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:42,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:51:42,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:51:42,168 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-14 19:51:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:42,202 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2021-12-14 19:51:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:51:42,203 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-14 19:51:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:42,204 INFO L225 Difference]: With dead ends: 102 [2021-12-14 19:51:42,204 INFO L226 Difference]: Without dead ends: 102 [2021-12-14 19:51:42,204 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-14 19:51:42,205 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.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:42,206 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.0s Time] [2021-12-14 19:51:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-14 19:51:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2021-12-14 19:51:42,209 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-14 19:51:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-12-14 19:51:42,210 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2021-12-14 19:51:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:42,211 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-12-14 19:51:42,211 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-14 19:51:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-12-14 19:51:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:51:42,211 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:42,212 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:42,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:51:42,212 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-14 19:51:42,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:42,213 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2021-12-14 19:51:42,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:42,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132664621] [2021-12-14 19:51:42,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:42,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:42,234 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-14 19:51:42,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:42,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132664621] [2021-12-14 19:51:42,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132664621] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:42,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:42,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:51:42,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065854267] [2021-12-14 19:51:42,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:42,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:51:42,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:42,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:51:42,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:51:42,237 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-14 19:51:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:42,244 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2021-12-14 19:51:42,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:51:42,245 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-14 19:51:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:42,245 INFO L225 Difference]: With dead ends: 68 [2021-12-14 19:51:42,245 INFO L226 Difference]: Without dead ends: 68 [2021-12-14 19:51:42,246 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-14 19:51:42,247 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-14 19:51:42,247 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-14 19:51:42,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-14 19:51:42,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2021-12-14 19:51:42,251 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-14 19:51:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2021-12-14 19:51:42,251 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2021-12-14 19:51:42,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:42,252 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2021-12-14 19:51:42,252 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-14 19:51:42,252 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2021-12-14 19:51:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:51:42,253 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:42,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:42,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:51:42,253 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-14 19:51:42,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:42,254 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2021-12-14 19:51:42,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:42,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371743464] [2021-12-14 19:51:42,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:42,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:42,294 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-14 19:51:42,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:42,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371743464] [2021-12-14 19:51:42,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371743464] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:42,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:42,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:51:42,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023050867] [2021-12-14 19:51:42,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:42,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:51:42,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:42,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:51:42,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:51:42,297 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-14 19:51:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:42,356 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-12-14 19:51:42,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:51:42,357 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-14 19:51:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:42,358 INFO L225 Difference]: With dead ends: 76 [2021-12-14 19:51:42,358 INFO L226 Difference]: Without dead ends: 76 [2021-12-14 19:51:42,358 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-14 19:51:42,359 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.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:42,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.0s Time] [2021-12-14 19:51:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-14 19:51:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2021-12-14 19:51:42,362 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-14 19:51:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-12-14 19:51:42,363 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2021-12-14 19:51:42,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:42,363 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-12-14 19:51:42,363 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-14 19:51:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-12-14 19:51:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:51:42,364 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:42,364 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:42,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:51:42,364 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-14 19:51:42,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:42,365 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2021-12-14 19:51:42,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:42,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503741432] [2021-12-14 19:51:42,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:42,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:42,452 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-14 19:51:42,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:42,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503741432] [2021-12-14 19:51:42,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503741432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:42,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:42,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:51:42,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255034524] [2021-12-14 19:51:42,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:42,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:51:42,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:42,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:51:42,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:51:42,456 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-14 19:51:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:42,517 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2021-12-14 19:51:42,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:51:42,518 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-14 19:51:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:42,520 INFO L225 Difference]: With dead ends: 61 [2021-12-14 19:51:42,520 INFO L226 Difference]: Without dead ends: 61 [2021-12-14 19:51:42,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-14 19:51:42,525 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-14 19:51:42,525 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-14 19:51:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-14 19:51:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2021-12-14 19:51:42,544 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-14 19:51:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-12-14 19:51:42,546 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2021-12-14 19:51:42,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:42,547 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-12-14 19:51:42,548 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-14 19:51:42,548 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-12-14 19:51:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:51:42,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:42,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:42,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:51:42,550 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-14 19:51:42,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:42,552 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2021-12-14 19:51:42,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:42,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335028524] [2021-12-14 19:51:42,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:42,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:42,614 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-14 19:51:42,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:42,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335028524] [2021-12-14 19:51:42,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335028524] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:42,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559395352] [2021-12-14 19:51:42,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:42,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:42,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:42,617 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-14 19:51:42,639 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-14 19:51:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:42,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:51:42,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:42,800 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-14 19:51:42,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:42,870 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-14 19:51:42,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559395352] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:42,872 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:51:42,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-14 19:51:42,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452989948] [2021-12-14 19:51:42,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:42,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:51:42,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:42,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:51:42,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:51:42,874 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-14 19:51:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:42,888 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2021-12-14 19:51:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:51:42,888 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-14 19:51:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:42,889 INFO L225 Difference]: With dead ends: 65 [2021-12-14 19:51:42,889 INFO L226 Difference]: Without dead ends: 65 [2021-12-14 19:51:42,889 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-14 19:51:42,893 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-14 19:51:42,895 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-14 19:51:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-14 19:51:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-14 19:51:42,899 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-14 19:51:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2021-12-14 19:51:42,901 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2021-12-14 19:51:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:42,902 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2021-12-14 19:51:42,903 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-14 19:51:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2021-12-14 19:51:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:51:42,903 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:42,903 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:42,923 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-14 19:51:43,120 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-14 19:51:43,121 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-14 19:51:43,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:43,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2021-12-14 19:51:43,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:43,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318588086] [2021-12-14 19:51:43,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:43,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:43,243 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-14 19:51:43,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:43,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318588086] [2021-12-14 19:51:43,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318588086] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:43,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:43,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:51:43,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52763444] [2021-12-14 19:51:43,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:43,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:51:43,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:43,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:51:43,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:51:43,244 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-14 19:51:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:43,380 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2021-12-14 19:51:43,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:51:43,381 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-14 19:51:43,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:43,381 INFO L225 Difference]: With dead ends: 116 [2021-12-14 19:51:43,382 INFO L226 Difference]: Without dead ends: 116 [2021-12-14 19:51:43,382 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-14 19:51:43,382 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-14 19:51:43,382 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-14 19:51:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-14 19:51:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2021-12-14 19:51:43,396 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-14 19:51:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2021-12-14 19:51:43,398 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 26 [2021-12-14 19:51:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:43,398 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2021-12-14 19:51:43,399 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-14 19:51:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2021-12-14 19:51:43,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:51:43,399 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:43,400 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:43,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:51:43,400 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-14 19:51:43,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:43,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2021-12-14 19:51:43,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:43,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295246135] [2021-12-14 19:51:43,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:43,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:43,478 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-14 19:51:43,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:43,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295246135] [2021-12-14 19:51:43,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295246135] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:43,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:43,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:51:43,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702515490] [2021-12-14 19:51:43,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:43,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:51:43,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:51:43,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:51:43,481 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-14 19:51:43,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:43,513 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2021-12-14 19:51:43,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:51:43,514 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-14 19:51:43,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:43,515 INFO L225 Difference]: With dead ends: 96 [2021-12-14 19:51:43,517 INFO L226 Difference]: Without dead ends: 96 [2021-12-14 19:51:43,518 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-14 19:51:43,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-14 19:51:43,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-14 19:51:43,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-14 19:51:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-12-14 19:51:43,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-14 19:51:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2021-12-14 19:51:43,522 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 26 [2021-12-14 19:51:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:43,523 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2021-12-14 19:51:43,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-14 19:51:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2021-12-14 19:51:43,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:51:43,524 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:43,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-14 19:51:43,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:51:43,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-14 19:51:43,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:43,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913226, now seen corresponding path program 1 times [2021-12-14 19:51:43,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:43,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397247234] [2021-12-14 19:51:43,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:43,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:43,653 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-14 19:51:43,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:43,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397247234] [2021-12-14 19:51:43,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397247234] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:43,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:43,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:51:43,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114814140] [2021-12-14 19:51:43,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:43,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:51:43,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:43,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:51:43,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:51:43,655 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-14 19:51:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:43,840 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2021-12-14 19:51:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:51:43,840 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-14 19:51:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:43,841 INFO L225 Difference]: With dead ends: 107 [2021-12-14 19:51:43,841 INFO L226 Difference]: Without dead ends: 107 [2021-12-14 19:51:43,841 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-14 19:51:43,841 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-14 19:51:43,841 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-14 19:51:43,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-14 19:51:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2021-12-14 19:51:43,843 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-14 19:51:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2021-12-14 19:51:43,843 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 26 [2021-12-14 19:51:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:43,843 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2021-12-14 19:51:43,843 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-14 19:51:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2021-12-14 19:51:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:51:43,844 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:43,844 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-14 19:51:43,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:51:43,844 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-14 19:51:43,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:43,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2021-12-14 19:51:43,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:43,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831486644] [2021-12-14 19:51:43,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:43,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:44,079 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-14 19:51:44,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:44,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831486644] [2021-12-14 19:51:44,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831486644] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:44,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652529102] [2021-12-14 19:51:44,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:44,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:44,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:44,094 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-14 19:51:44,123 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-14 19:51:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:44,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-14 19:51:44,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:44,195 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-14 19:51:44,237 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:51:44,238 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-14 19:51:44,331 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-14 19:51:44,447 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 9 [2021-12-14 19:51:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:51:44,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:44,676 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-14 19:51:44,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652529102] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:44,676 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:51:44,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 33 [2021-12-14 19:51:44,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401594492] [2021-12-14 19:51:44,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:44,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-14 19:51:44,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:44,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-14 19:51:44,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2021-12-14 19:51:44,678 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 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-14 19:51:45,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:45,495 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2021-12-14 19:51:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 19:51:45,496 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 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) Word has length 29 [2021-12-14 19:51:45,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:45,497 INFO L225 Difference]: With dead ends: 105 [2021-12-14 19:51:45,497 INFO L226 Difference]: Without dead ends: 105 [2021-12-14 19:51:45,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2021-12-14 19:51:45,498 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 750 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:45,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [750 Valid, 610 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:51:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-14 19:51:45,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2021-12-14 19:51:45,500 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-14 19:51:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2021-12-14 19:51:45,500 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 29 [2021-12-14 19:51:45,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:45,500 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2021-12-14 19:51:45,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 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-14 19:51:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2021-12-14 19:51:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:51:45,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:45,501 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-14 19:51:45,520 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-14 19:51:45,711 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-14 19:51:45,711 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-14 19:51:45,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:45,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687585, now seen corresponding path program 1 times [2021-12-14 19:51:45,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:45,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026030080] [2021-12-14 19:51:45,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:45,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:45,926 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-14 19:51:45,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:45,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026030080] [2021-12-14 19:51:45,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026030080] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:45,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143107863] [2021-12-14 19:51:45,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:45,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:45,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:45,928 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-14 19:51:45,929 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-14 19:51:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:46,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-14 19:51:46,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:46,031 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-14 19:51:46,035 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-14 19:51:46,151 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:51:46,151 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-14 19:51:46,155 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-14 19:51:46,251 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-14 19:51:46,256 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-14 19:51:46,429 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-14 19:51:46,433 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 19 treesize of output 7 [2021-12-14 19:51:46,445 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-14 19:51:46,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:47,061 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-14 19:51:47,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143107863] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:47,062 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:51:47,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 39 [2021-12-14 19:51:47,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496886920] [2021-12-14 19:51:47,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:47,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-14 19:51:47,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:47,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-14 19:51:47,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1450, Unknown=0, NotChecked=0, Total=1560 [2021-12-14 19:51:47,064 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 40 states, 39 states have (on average 2.051282051282051) internal successors, (80), 40 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-14 19:51:49,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:49,397 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2021-12-14 19:51:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 19:51:49,398 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.051282051282051) internal successors, (80), 40 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) Word has length 29 [2021-12-14 19:51:49,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:49,399 INFO L225 Difference]: With dead ends: 213 [2021-12-14 19:51:49,399 INFO L226 Difference]: Without dead ends: 213 [2021-12-14 19:51:49,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=765, Invalid=3267, Unknown=0, NotChecked=0, Total=4032 [2021-12-14 19:51:49,400 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 2637 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2637 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:49,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2637 Valid, 708 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 894 Invalid, 0 Unknown, 92 Unchecked, 0.5s Time] [2021-12-14 19:51:49,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-14 19:51:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 84. [2021-12-14 19:51:49,402 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-14 19:51:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2021-12-14 19:51:49,402 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 29 [2021-12-14 19:51:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:49,402 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2021-12-14 19:51:49,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.051282051282051) internal successors, (80), 40 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-14 19:51:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2021-12-14 19:51:49,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:51:49,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:49,403 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-14 19:51:49,437 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-14 19:51:49,611 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-14 19:51:49,611 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-14 19:51:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:49,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1082686446, now seen corresponding path program 2 times [2021-12-14 19:51:49,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:49,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192477324] [2021-12-14 19:51:49,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:49,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:49,688 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-14 19:51:49,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:49,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192477324] [2021-12-14 19:51:49,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192477324] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:49,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:49,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:51:49,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589752533] [2021-12-14 19:51:49,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:49,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:51:49,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:49,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:51:49,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:51:49,690 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-14 19:51:49,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:49,715 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2021-12-14 19:51:49,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:51:49,715 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-14 19:51:49,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:49,716 INFO L225 Difference]: With dead ends: 70 [2021-12-14 19:51:49,716 INFO L226 Difference]: Without dead ends: 70 [2021-12-14 19:51:49,716 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-14 19:51:49,716 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-14 19:51:49,717 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-14 19:51:49,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-14 19:51:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-12-14 19:51:49,718 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-14 19:51:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2021-12-14 19:51:49,718 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 32 [2021-12-14 19:51:49,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:49,719 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2021-12-14 19:51:49,719 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-14 19:51:49,719 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2021-12-14 19:51:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 19:51:49,722 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:49,722 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-14 19:51:49,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:51:49,723 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-14 19:51:49,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:49,723 INFO L85 PathProgramCache]: Analyzing trace with hash -516260032, now seen corresponding path program 1 times [2021-12-14 19:51:49,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:49,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117443421] [2021-12-14 19:51:49,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:49,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:49,788 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-14 19:51:49,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:49,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117443421] [2021-12-14 19:51:49,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117443421] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:49,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:49,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:51:49,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098057111] [2021-12-14 19:51:49,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:49,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:51:49,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:49,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:51:49,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:51:49,792 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-14 19:51:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:49,920 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2021-12-14 19:51:49,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:51:49,920 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-14 19:51:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:49,921 INFO L225 Difference]: With dead ends: 89 [2021-12-14 19:51:49,921 INFO L226 Difference]: Without dead ends: 89 [2021-12-14 19:51:49,921 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-14 19:51:49,922 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-14 19:51:49,922 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-14 19:51:49,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-14 19:51:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2021-12-14 19:51:49,923 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-14 19:51:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2021-12-14 19:51:49,924 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 36 [2021-12-14 19:51:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:49,924 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2021-12-14 19:51:49,924 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-14 19:51:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2021-12-14 19:51:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 19:51:49,924 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:49,924 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-14 19:51:49,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:51:49,924 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-14 19:51:49,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:49,925 INFO L85 PathProgramCache]: Analyzing trace with hash -516260031, now seen corresponding path program 1 times [2021-12-14 19:51:49,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:49,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881769373] [2021-12-14 19:51:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:49,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:49,995 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-14 19:51:49,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:49,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881769373] [2021-12-14 19:51:49,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881769373] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:49,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349166915] [2021-12-14 19:51:49,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:49,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:49,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:49,997 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-14 19:51:49,998 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-14 19:51:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:50,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:51:50,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:50,137 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-14 19:51:50,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:50,203 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-14 19:51:50,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349166915] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:50,203 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:51:50,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-12-14 19:51:50,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497956208] [2021-12-14 19:51:50,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:50,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:51:50,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:50,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:51:50,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:51:50,205 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-14 19:51:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:50,223 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2021-12-14 19:51:50,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:51:50,223 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-14 19:51:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:50,224 INFO L225 Difference]: With dead ends: 95 [2021-12-14 19:51:50,224 INFO L226 Difference]: Without dead ends: 95 [2021-12-14 19:51:50,224 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-14 19:51:50,225 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-14 19:51:50,225 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-14 19:51:50,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-14 19:51:50,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2021-12-14 19:51:50,226 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-14 19:51:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2021-12-14 19:51:50,227 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 36 [2021-12-14 19:51:50,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:50,228 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2021-12-14 19:51:50,228 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-14 19:51:50,228 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2021-12-14 19:51:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:51:50,231 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:50,231 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-14 19:51:50,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-14 19:51:50,447 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-14 19:51:50,448 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-14 19:51:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1215669110, now seen corresponding path program 1 times [2021-12-14 19:51:50,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:50,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628492184] [2021-12-14 19:51:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:50,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:50,507 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-14 19:51:50,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:50,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628492184] [2021-12-14 19:51:50,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628492184] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:50,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651165745] [2021-12-14 19:51:50,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:50,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:50,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:50,509 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-14 19:51:50,510 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-14 19:51:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:50,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:51:50,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:50,662 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-14 19:51:50,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:50,720 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-14 19:51:50,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651165745] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:50,720 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:51:50,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-12-14 19:51:50,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125121587] [2021-12-14 19:51:50,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:50,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:51:50,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:50,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:51:50,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:51:50,722 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-14 19:51:50,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:50,749 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2021-12-14 19:51:50,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:51:50,749 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-14 19:51:50,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:50,750 INFO L225 Difference]: With dead ends: 90 [2021-12-14 19:51:50,750 INFO L226 Difference]: Without dead ends: 90 [2021-12-14 19:51:50,752 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-14 19:51:50,756 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 142 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:50,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 135 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:50,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-14 19:51:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2021-12-14 19:51:50,759 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-14 19:51:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2021-12-14 19:51:50,760 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 37 [2021-12-14 19:51:50,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:50,760 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2021-12-14 19:51:50,760 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-14 19:51:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2021-12-14 19:51:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:51:50,761 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:50,761 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-14 19:51:50,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:50,977 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-14 19:51:50,978 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-14 19:51:50,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:50,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522149, now seen corresponding path program 2 times [2021-12-14 19:51:50,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:50,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332122933] [2021-12-14 19:51:50,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:50,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:51,024 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-14 19:51:51,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:51,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332122933] [2021-12-14 19:51:51,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332122933] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:51,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:51,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:51:51,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141089249] [2021-12-14 19:51:51,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:51,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:51:51,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:51,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:51:51,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:51:51,026 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-14 19:51:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:51,050 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2021-12-14 19:51:51,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:51:51,050 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-14 19:51:51,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:51,051 INFO L225 Difference]: With dead ends: 89 [2021-12-14 19:51:51,051 INFO L226 Difference]: Without dead ends: 89 [2021-12-14 19:51:51,051 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-14 19:51:51,051 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 76 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 135 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-14 19:51:51,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 135 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-14 19:51:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2021-12-14 19:51:51,055 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-14 19:51:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2021-12-14 19:51:51,056 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 41 [2021-12-14 19:51:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:51,056 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2021-12-14 19:51:51,056 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-14 19:51:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2021-12-14 19:51:51,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:51:51,057 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:51,057 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-14 19:51:51,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 19:51:51,057 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-14 19:51:51,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:51,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522204, now seen corresponding path program 1 times [2021-12-14 19:51:51,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:51,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480725313] [2021-12-14 19:51:51,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:51,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:51,204 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-14 19:51:51,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:51,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480725313] [2021-12-14 19:51:51,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480725313] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:51,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:51,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:51:51,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366745060] [2021-12-14 19:51:51,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:51,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:51:51,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:51,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:51:51,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:51:51,206 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-14 19:51:51,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:51,381 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2021-12-14 19:51:51,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:51:51,381 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-14 19:51:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:51,382 INFO L225 Difference]: With dead ends: 107 [2021-12-14 19:51:51,382 INFO L226 Difference]: Without dead ends: 107 [2021-12-14 19:51:51,382 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-14 19:51:51,383 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-14 19:51:51,383 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-14 19:51:51,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-14 19:51:51,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2021-12-14 19:51:51,387 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-14 19:51:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2021-12-14 19:51:51,388 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 41 [2021-12-14 19:51:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:51,388 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2021-12-14 19:51:51,388 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-14 19:51:51,388 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2021-12-14 19:51:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 19:51:51,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:51,389 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-14 19:51:51,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 19:51:51,389 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-14 19:51:51,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:51,390 INFO L85 PathProgramCache]: Analyzing trace with hash -333530929, now seen corresponding path program 1 times [2021-12-14 19:51:51,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:51,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650743318] [2021-12-14 19:51:51,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:51,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:51,714 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-14 19:51:51,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:51,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650743318] [2021-12-14 19:51:51,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650743318] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:51,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926029021] [2021-12-14 19:51:51,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:51,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:51,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:51,717 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-14 19:51:51,718 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-14 19:51:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:51,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-14 19:51:51,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:51,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-14 19:51:51,862 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:51:51,862 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-14 19:51:51,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, 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-14 19:51:52,080 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:51:52,081 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-14 19:51:52,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:52,162 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-14 19:51:52,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 31 treesize of output 13 [2021-12-14 19:51:52,250 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-14 19:51:52,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:54,810 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-14 19:51:54,810 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-14 19:51:54,814 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (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_845) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2021-12-14 19:51:54,820 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_845) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base|)) is different from false [2021-12-14 19:51:54,825 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_845) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) .cse0))) is different from false [2021-12-14 19:51:54,832 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (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_845) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2021-12-14 19:51:54,836 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (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))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_845) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse0)))) is different from false [2021-12-14 19:51:54,841 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (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))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_845) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) .cse0)))) is different from false [2021-12-14 19:51:54,859 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (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_845) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))))) is different from false [2021-12-14 19:51:54,864 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:54,865 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-14 19:51:54,867 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-14 19:51:54,869 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-14 19:51:54,961 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-14 19:51:54,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926029021] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:54,961 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:51:54,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 49 [2021-12-14 19:51:54,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927890829] [2021-12-14 19:51:54,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:54,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-14 19:51:54,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:54,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-14 19:51:54,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1690, Unknown=7, NotChecked=616, Total=2450 [2021-12-14 19:51:54,963 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 50 states, 49 states have (on average 2.183673469387755) internal successors, (107), 50 states have internal predecessors, (107), 0 states have call successors, (0), 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-14 19:51:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:56,082 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2021-12-14 19:51:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-14 19:51:56,083 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.183673469387755) internal successors, (107), 50 states have internal predecessors, (107), 0 states have call successors, (0), 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-14 19:51:56,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:56,083 INFO L225 Difference]: With dead ends: 136 [2021-12-14 19:51:56,083 INFO L226 Difference]: Without dead ends: 136 [2021-12-14 19:51:56,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=587, Invalid=3724, Unknown=7, NotChecked=938, Total=5256 [2021-12-14 19:51:56,085 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 696 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 804 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:56,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [696 Valid, 849 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 956 Invalid, 0 Unknown, 804 Unchecked, 0.3s Time] [2021-12-14 19:51:56,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-14 19:51:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2021-12-14 19:51:56,086 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-14 19:51:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2021-12-14 19:51:56,087 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 44 [2021-12-14 19:51:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:56,087 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2021-12-14 19:51:56,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.183673469387755) internal successors, (107), 50 states have internal predecessors, (107), 0 states have call successors, (0), 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-14 19:51:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2021-12-14 19:51:56,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 19:51:56,087 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:56,087 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-14 19:51:56,107 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-14 19:51:56,287 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-14 19:51:56,288 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-14 19:51:56,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:56,288 INFO L85 PathProgramCache]: Analyzing trace with hash -333530928, now seen corresponding path program 1 times [2021-12-14 19:51:56,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:56,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45924016] [2021-12-14 19:51:56,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:56,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:56,705 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-14 19:51:56,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:56,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45924016] [2021-12-14 19:51:56,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45924016] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:56,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712721270] [2021-12-14 19:51:56,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:56,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:56,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:56,707 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-14 19:51:56,708 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-14 19:51:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:56,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-14 19:51:56,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:56,873 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-14 19:51:57,032 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:51:57,033 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-14 19:51:57,128 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-14 19:51:57,132 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-14 19:51:57,357 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:51:57,357 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-14 19:51:57,361 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-14 19:51:57,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:57,472 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-14 19:51:57,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:57,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2021-12-14 19:51:57,540 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-14 19:51:57,542 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-14 19:51:57,598 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-14 19:51:57,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:59,820 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_ArrVal_959 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_959) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_961 Int) (v_ArrVal_959 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_959) .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_961) .cse0)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) is different from false [2021-12-14 19:51:59,869 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:59,870 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-14 19:51:59,937 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_prenex_2 Int) (v_ArrVal_958 (Array Int Int))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_958) |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_sll_update_at_~head#1.offset|)) (forall ((v_ArrVal_961 Int) (v_ArrVal_957 (Array Int 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_957) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_959 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) (+ |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-14 19:52:00,009 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_prenex_2 Int) (v_ArrVal_958 (Array Int Int))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_958) |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_sll_update_at_#t~mem10#1.offset|)) (forall ((v_ArrVal_961 Int) (v_ArrVal_957 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_957) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base|)) (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_959 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) is different from false [2021-12-14 19:52:00,086 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_ArrVal_961 Int) (v_ArrVal_957 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_957) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (forall ((v_prenex_2 Int) (v_ArrVal_958 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|))) (<= (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_958) |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)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1)))) (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_959 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|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) (+ |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-14 19:52:00,143 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_959 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_958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) .cse0)))) (forall ((v_ArrVal_961 Int) (v_ArrVal_957 (Array Int 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))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_957) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) .cse2) .cse1)))) (forall ((v_prenex_2 Int) (v_ArrVal_958 (Array Int 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_958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) is different from false [2021-12-14 19:52:00,172 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_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_prenex_2 Int) (v_ArrVal_958 (Array Int 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_958) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0)))) (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_959 Int)) (<= 0 (let ((.cse1 (+ |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|) .cse1) v_ArrVal_958) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) .cse1)))) (forall ((v_ArrVal_961 Int) (v_ArrVal_957 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (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_957) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) .cse3) .cse2))))))) is different from false [2021-12-14 19:52:00,202 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_prenex_2 Int) (v_ArrVal_958 (Array Int Int))) (let ((.cse0 (+ |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|) .cse0) v_ArrVal_958) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_959 Int)) (<= 0 (let ((.cse1 (+ |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|) .cse1) v_ArrVal_958) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) .cse1)))) (forall ((v_ArrVal_961 Int) (v_ArrVal_957 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_957) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) .cse3) .cse2))))))) is different from false [2021-12-14 19:52:00,280 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_prenex_2 Int) (v_ArrVal_958 (Array Int Int))) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (<= (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_958) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)))) (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_959 Int)) (<= 0 (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (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_958) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) .cse1)))) (forall ((v_ArrVal_961 Int) (v_ArrVal_957 (Array Int Int))) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_957) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) .cse3) .cse2))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) is different from false [2021-12-14 19:52:00,292 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:00,293 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-14 19:52:00,295 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-14 19:52:00,297 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:00,299 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-14 19:52:00,303 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:00,303 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-14 19:52:00,306 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-14 19:52:00,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:00,309 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-14 19:52:00,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:00,313 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-14 19:52:00,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:00,316 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-14 19:52:00,318 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:00,319 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-14 19:52:00,606 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-14 19:52:00,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712721270] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:00,606 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:00,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 55 [2021-12-14 19:52:00,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595823638] [2021-12-14 19:52:00,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:00,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-12-14 19:52:00,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:00,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-12-14 19:52:00,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2116, Unknown=8, NotChecked=792, Total=3080 [2021-12-14 19:52:00,608 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 56 states, 55 states have (on average 2.109090909090909) internal successors, (116), 56 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-14 19:52:12,212 WARN L227 SmtUtils]: Spent 10.56s on a formula simplification. DAG size of input: 55 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-14 19:52:15,052 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse5)) (.cse2 (select .cse3 .cse5))) (and (<= 0 .cse0) (= 0 (select .cse1 4)) (not (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|)) (<= 8 (select |c_#length| (select .cse3 4))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_ArrVal_959 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_959) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_961 Int) (v_ArrVal_959 Int)) (let ((.cse4 (+ |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_959) .cse4) 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_961) .cse4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) (<= (+ 4 .cse0) (select |c_#length| .cse2)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-14 19:52:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:15,541 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2021-12-14 19:52:15,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-14 19:52:15,541 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.109090909090909) internal successors, (116), 56 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 44 [2021-12-14 19:52:15,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:15,542 INFO L225 Difference]: With dead ends: 151 [2021-12-14 19:52:15,542 INFO L226 Difference]: Without dead ends: 151 [2021-12-14 19:52:15,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=648, Invalid=4490, Unknown=10, NotChecked=1332, Total=6480 [2021-12-14 19:52:15,543 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 551 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1011 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:15,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 1406 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 962 Invalid, 0 Unknown, 1011 Unchecked, 0.4s Time] [2021-12-14 19:52:15,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-14 19:52:15,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 90. [2021-12-14 19:52:15,545 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-14 19:52:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2021-12-14 19:52:15,546 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 44 [2021-12-14 19:52:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:15,546 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2021-12-14 19:52:15,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.109090909090909) internal successors, (116), 56 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-14 19:52:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2021-12-14 19:52:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-14 19:52:15,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:15,546 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-14 19:52:15,565 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-14 19:52:15,755 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-14 19:52:15,755 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-14 19:52:15,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:15,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1958848316, now seen corresponding path program 2 times [2021-12-14 19:52:15,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:15,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295622120] [2021-12-14 19:52:15,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:15,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:15,794 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-14 19:52:15,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:15,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295622120] [2021-12-14 19:52:15,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295622120] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:15,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:15,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:52:15,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096433625] [2021-12-14 19:52:15,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:15,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:52:15,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:15,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:52:15,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:52:15,796 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-14 19:52:15,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:15,819 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-12-14 19:52:15,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:52:15,820 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-14 19:52:15,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:15,820 INFO L225 Difference]: With dead ends: 76 [2021-12-14 19:52:15,820 INFO L226 Difference]: Without dead ends: 76 [2021-12-14 19:52:15,820 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-14 19:52:15,821 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 109 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:15,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 73 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:52:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-14 19:52:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-14 19:52:15,822 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-14 19:52:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2021-12-14 19:52:15,823 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 47 [2021-12-14 19:52:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:15,823 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2021-12-14 19:52:15,823 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-14 19:52:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2021-12-14 19:52:15,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-14 19:52:15,824 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:15,824 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-14 19:52:15,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-14 19:52:15,824 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-14 19:52:15,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:15,824 INFO L85 PathProgramCache]: Analyzing trace with hash -645325999, now seen corresponding path program 1 times [2021-12-14 19:52:15,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:15,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40113694] [2021-12-14 19:52:15,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:15,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:16,433 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-14 19:52:16,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:16,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40113694] [2021-12-14 19:52:16,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40113694] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:16,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167049053] [2021-12-14 19:52:16,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:16,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:16,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:16,434 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-14 19:52:16,435 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-14 19:52:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:16,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 100 conjunts are in the unsatisfiable core [2021-12-14 19:52:16,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:16,561 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-14 19:52:16,601 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:52:16,602 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-14 19:52:16,665 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-14 19:52:16,668 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-14 19:52:16,918 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:16,918 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-14 19:52:16,921 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-14 19:52:16,924 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-14 19:52:17,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:17,038 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-14 19:52:17,044 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-14 19:52:17,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:17,048 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-14 19:52:17,184 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 71 treesize of output 47 [2021-12-14 19:52:17,189 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 49 treesize of output 31 [2021-12-14 19:52:17,270 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-14 19:52:17,385 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-14 19:52:17,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:17,580 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (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_1128) (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_1130)) |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_1131)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1))) (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 Int)) (<= (+ (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_1128) (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_1130)) |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_1131)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)))) is different from false [2021-12-14 19:52:17,613 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|) (and (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 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_1128) (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_1130) .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_1131) .cse0))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 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_1128) (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_1130) .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_1131) .cse1))) 1)))))) is different from false [2021-12-14 19:52:17,668 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:17,668 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-14 19:52:17,688 INFO L354 Elim1Store]: treesize reduction 90, result has 30.8 percent of original size [2021-12-14 19:52:17,689 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-14 19:52:17,695 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-14 19:52:17,699 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-14 19:52:17,785 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 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse1 .cse0) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int 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_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1124) |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.offset|)))))) is different from false [2021-12-14 19:52:17,878 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 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int 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_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1124) |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)))))))) is different from false [2021-12-14 19:52:17,919 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 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (<= .cse1 .cse0) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int 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|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse3) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse3) v_ArrVal_1124) |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))))))))) is different from false [2021-12-14 19:52:17,993 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 ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 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_1124) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int 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_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse3) .cse2)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int 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_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse4)) |c_ULTIMATE.start_main_~s~0#1.base|))))))) is different from false [2021-12-14 19:52:18,022 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (and (forall ((v_prenex_7 Int) (v_ArrVal_1123 (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))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1123) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse1) .cse0)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (let ((.cse2 (+ |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|) .cse2) v_ArrVal_1123) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse2)) |c_ULTIMATE.start_sll_create_#res#1.base|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) (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_1124) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse3))))))) is different from false [2021-12-14 19:52:18,067 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int 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_1123) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_1124) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse1)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse3) .cse2))))) (< |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-14 19:52:18,146 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (and (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) (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_1124) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse0)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse1)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (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_1123) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse3)))))))) is different from false [2021-12-14 19:52:18,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:18,157 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 75 treesize of output 71 [2021-12-14 19:52:18,160 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:18,161 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 67 treesize of output 58 [2021-12-14 19:52:18,163 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 92 treesize of output 86 [2021-12-14 19:52:18,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:18,165 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 80 treesize of output 68 [2021-12-14 19:52:18,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:18,168 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-14 19:52:18,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:18,171 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-14 19:52:18,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:18,173 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-14 19:52:18,305 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-14 19:52:18,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167049053] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:18,306 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:18,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 26] total 64 [2021-12-14 19:52:18,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990326337] [2021-12-14 19:52:18,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:18,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-12-14 19:52:18,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-12-14 19:52:18,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2816, Unknown=9, NotChecked=1026, Total=4032 [2021-12-14 19:52:18,307 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 64 states, 64 states have (on average 1.890625) internal successors, (121), 64 states have internal predecessors, (121), 0 states have call successors, (0), 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-14 19:52:20,630 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (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|) 1) (= |c_ULTIMATE.start_node_create_~temp~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_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (and (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) (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_1124) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse0)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse1)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (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_1123) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse3)))))))) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1)) is different from false [2021-12-14 19:52:22,633 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int 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_1123) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_1124) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse1)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse3) .cse2))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (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-14 19:52:24,636 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int 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_1123) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_1124) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse1)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse3) .cse2))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (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-14 19:52:26,659 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (and (forall ((v_prenex_7 Int) (v_ArrVal_1123 (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))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1123) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse1) .cse0)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (let ((.cse2 (+ |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|) .cse2) v_ArrVal_1123) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse2)) |c_ULTIMATE.start_sll_create_#res#1.base|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) (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_1124) |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.offset| 0) (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-14 19:52:28,663 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 (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (<= .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 ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse1) (<= .cse1 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 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_1124) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int 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_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse4) .cse3)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int 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_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse5)) |c_ULTIMATE.start_main_~s~0#1.base|))))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-14 19:52:30,669 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) (<= .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 ((.cse2 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse1 .cse2) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (<= .cse2 .cse1) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int 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|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse4 (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse4) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse4) v_ArrVal_1124) |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))))))))) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| 0) (= |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))) is different from false [2021-12-14 19:52:32,696 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) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (<= .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 ((.cse2 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse1 .cse2) (<= .cse2 .cse1) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int 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_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1124) |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)))))))) (not (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |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_~s~0#1.offset| 0))) is different from false [2021-12-14 19:52:34,725 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (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 ((.cse2 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse1 .cse2) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse2 .cse1) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int 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_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1124) |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.offset|)))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-14 19:52:36,730 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= |c_ULTIMATE.start_node_create_~temp~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_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (and (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) (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_1124) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse0)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse1)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (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_1123) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse3)))))))) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1)) is different from false [2021-12-14 19:52:36,735 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1)) (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|) (and (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 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_1128) (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_1130) .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_1131) .cse2))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 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_1128) (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_1130) .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_1131) .cse3))) 1)))))) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= (select (select |c_#memory_int| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-14 19:52:36,738 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse1 (+ (select (select |c_#memory_int| .cse2) (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) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (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|) (and (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 Int)) (<= (+ (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_1128) (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_1130) .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_1131) .cse3))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse4 (+ |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_1128) (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_1130) .cse4)) (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_1131) .cse4))) 1)))))) (<= .cse1 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-14 19:52:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:37,598 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2021-12-14 19:52:37,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-14 19:52:37,598 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.890625) internal successors, (121), 64 states have internal predecessors, (121), 0 states have call successors, (0), 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-14 19:52:37,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:37,599 INFO L225 Difference]: With dead ends: 83 [2021-12-14 19:52:37,599 INFO L226 Difference]: Without dead ends: 83 [2021-12-14 19:52:37,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=502, Invalid=4814, Unknown=20, NotChecked=3220, Total=8556 [2021-12-14 19:52:37,601 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 195 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 629 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:37,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 780 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 955 Invalid, 0 Unknown, 629 Unchecked, 0.4s Time] [2021-12-14 19:52:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-14 19:52:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2021-12-14 19:52:37,602 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-14 19:52:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2021-12-14 19:52:37,603 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 48 [2021-12-14 19:52:37,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:37,603 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2021-12-14 19:52:37,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.890625) internal successors, (121), 64 states have internal predecessors, (121), 0 states have call successors, (0), 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-14 19:52:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2021-12-14 19:52:37,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-14 19:52:37,603 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:37,603 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-14 19:52:37,621 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-14 19:52:37,815 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-14 19:52:37,815 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-14 19:52:37,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:37,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1693462380, now seen corresponding path program 1 times [2021-12-14 19:52:37,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:37,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063028631] [2021-12-14 19:52:37,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:37,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:37,975 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-14 19:52:37,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:37,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063028631] [2021-12-14 19:52:37,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063028631] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:37,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114977108] [2021-12-14 19:52:37,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:37,976 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:37,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:37,977 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-14 19:52:37,978 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-14 19:52:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:38,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-14 19:52:38,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:38,352 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-14 19:52:38,540 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-14 19:52:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 19:52:38,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:38,735 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-14 19:52:38,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:38,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:38,852 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-14 19:52:38,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114977108] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:38,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:38,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 12] total 35 [2021-12-14 19:52:38,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688839575] [2021-12-14 19:52:38,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:38,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-14 19:52:38,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:38,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-14 19:52:38,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2021-12-14 19:52:38,853 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 35 states, 35 states have (on average 3.657142857142857) internal successors, (128), 35 states have internal predecessors, (128), 0 states have call successors, (0), 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-14 19:52:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:39,517 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2021-12-14 19:52:39,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-14 19:52:39,518 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.657142857142857) internal successors, (128), 35 states have internal predecessors, (128), 0 states have call successors, (0), 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-14 19:52:39,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:39,519 INFO L225 Difference]: With dead ends: 99 [2021-12-14 19:52:39,519 INFO L226 Difference]: Without dead ends: 99 [2021-12-14 19:52:39,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=471, Invalid=2079, Unknown=0, NotChecked=0, Total=2550 [2021-12-14 19:52:39,520 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 715 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:39,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [715 Valid, 514 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:52:39,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-14 19:52:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2021-12-14 19:52:39,521 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-14 19:52:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2021-12-14 19:52:39,521 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 55 [2021-12-14 19:52:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:39,521 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2021-12-14 19:52:39,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.657142857142857) internal successors, (128), 35 states have internal predecessors, (128), 0 states have call successors, (0), 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-14 19:52:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2021-12-14 19:52:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 19:52:39,522 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:39,522 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-14 19:52:39,549 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-14 19:52:39,722 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-14 19:52:39,723 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-14 19:52:39,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:39,723 INFO L85 PathProgramCache]: Analyzing trace with hash 261778123, now seen corresponding path program 2 times [2021-12-14 19:52:39,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:39,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086376906] [2021-12-14 19:52:39,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:39,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:39,766 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-14 19:52:39,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:39,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086376906] [2021-12-14 19:52:39,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086376906] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:39,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354590399] [2021-12-14 19:52:39,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:52:39,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:39,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:39,782 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-14 19:52:39,830 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-14 19:52:39,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:52:39,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:52:39,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:52:39,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:40,010 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-14 19:52:40,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:40,072 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-14 19:52:40,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354590399] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:40,072 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:40,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-12-14 19:52:40,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468196233] [2021-12-14 19:52:40,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:40,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:52:40,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:40,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:52:40,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:52:40,074 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-14 19:52:40,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:40,099 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2021-12-14 19:52:40,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:52:40,100 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-14 19:52:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:40,100 INFO L225 Difference]: With dead ends: 71 [2021-12-14 19:52:40,100 INFO L226 Difference]: Without dead ends: 71 [2021-12-14 19:52:40,101 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-14 19:52:40,104 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 114 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:40,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 123 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:52:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-14 19:52:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-14 19:52:40,106 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-14 19:52:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2021-12-14 19:52:40,107 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 58 [2021-12-14 19:52:40,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:40,108 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2021-12-14 19:52:40,108 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-14 19:52:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2021-12-14 19:52:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-14 19:52:40,109 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:40,109 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-14 19:52:40,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 19:52:40,325 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-14 19:52:40,326 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-14 19:52:40,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:40,326 INFO L85 PathProgramCache]: Analyzing trace with hash 187254194, now seen corresponding path program 1 times [2021-12-14 19:52:40,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:40,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24085235] [2021-12-14 19:52:40,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:40,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:40,385 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-14 19:52:40,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:40,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24085235] [2021-12-14 19:52:40,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24085235] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:40,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:40,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:52:40,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728817784] [2021-12-14 19:52:40,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:40,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:52:40,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:40,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:52:40,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:52:40,390 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-14 19:52:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:40,506 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2021-12-14 19:52:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:52:40,507 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-14 19:52:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:40,507 INFO L225 Difference]: With dead ends: 82 [2021-12-14 19:52:40,507 INFO L226 Difference]: Without dead ends: 82 [2021-12-14 19:52:40,507 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-14 19:52:40,508 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-14 19:52:40,508 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-14 19:52:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-14 19:52:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2021-12-14 19:52:40,509 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-14 19:52:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2021-12-14 19:52:40,509 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 59 [2021-12-14 19:52:40,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:40,509 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2021-12-14 19:52:40,509 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-14 19:52:40,509 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2021-12-14 19:52:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-14 19:52:40,510 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:40,510 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-14 19:52:40,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-14 19:52:40,510 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-14 19:52:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:40,510 INFO L85 PathProgramCache]: Analyzing trace with hash 187254195, now seen corresponding path program 1 times [2021-12-14 19:52:40,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:40,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464751560] [2021-12-14 19:52:40,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:40,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:40,588 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-14 19:52:40,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:40,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464751560] [2021-12-14 19:52:40,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464751560] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:40,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:40,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:52:40,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380958779] [2021-12-14 19:52:40,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:40,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:52:40,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:40,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:52:40,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:52:40,590 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-14 19:52:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:40,743 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-12-14 19:52:40,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:52:40,744 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-14 19:52:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:40,744 INFO L225 Difference]: With dead ends: 80 [2021-12-14 19:52:40,744 INFO L226 Difference]: Without dead ends: 80 [2021-12-14 19:52:40,745 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-14 19:52:40,745 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-14 19:52:40,745 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-14 19:52:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-14 19:52:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2021-12-14 19:52:40,746 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-14 19:52:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2021-12-14 19:52:40,746 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 59 [2021-12-14 19:52:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:40,746 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2021-12-14 19:52:40,746 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-14 19:52:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2021-12-14 19:52:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-14 19:52:40,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:40,747 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-14 19:52:40,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-14 19:52:40,747 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-14 19:52:40,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:40,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1509911310, now seen corresponding path program 1 times [2021-12-14 19:52:40,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:40,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455455930] [2021-12-14 19:52:40,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:40,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:40,795 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-14 19:52:40,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:40,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455455930] [2021-12-14 19:52:40,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455455930] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:40,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:40,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:52:40,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759745395] [2021-12-14 19:52:40,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:40,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:52:40,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:40,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:52:40,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:52:40,798 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-14 19:52:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:40,889 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2021-12-14 19:52:40,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:52:40,889 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-14 19:52:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:40,890 INFO L225 Difference]: With dead ends: 77 [2021-12-14 19:52:40,890 INFO L226 Difference]: Without dead ends: 77 [2021-12-14 19:52:40,890 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-14 19:52:40,890 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.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:40,892 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.0s Time] [2021-12-14 19:52:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-14 19:52:40,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2021-12-14 19:52:40,893 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-14 19:52:40,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-12-14 19:52:40,894 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 60 [2021-12-14 19:52:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:40,894 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-12-14 19:52:40,894 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-14 19:52:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-12-14 19:52:40,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-14 19:52:40,895 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:40,895 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-14 19:52:40,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-14 19:52:40,895 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-14 19:52:40,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:40,896 INFO L85 PathProgramCache]: Analyzing trace with hash -672727665, now seen corresponding path program 1 times [2021-12-14 19:52:40,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:40,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820057528] [2021-12-14 19:52:40,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:40,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:40,981 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-14 19:52:40,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:40,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820057528] [2021-12-14 19:52:40,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820057528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:40,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:40,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:52:40,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790193612] [2021-12-14 19:52:40,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:40,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:52:40,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:40,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:52:40,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:52:40,984 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-14 19:52:41,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:41,094 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2021-12-14 19:52:41,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:52:41,095 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-14 19:52:41,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:41,095 INFO L225 Difference]: With dead ends: 75 [2021-12-14 19:52:41,095 INFO L226 Difference]: Without dead ends: 75 [2021-12-14 19:52:41,096 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-14 19:52:41,096 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-14 19:52:41,096 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-14 19:52:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-14 19:52:41,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-12-14 19:52:41,097 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-14 19:52:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-12-14 19:52:41,097 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2021-12-14 19:52:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:41,097 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-12-14 19:52:41,097 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-14 19:52:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-12-14 19:52:41,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 19:52:41,098 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:41,098 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-14 19:52:41,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-14 19:52:41,098 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-14 19:52:41,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:41,098 INFO L85 PathProgramCache]: Analyzing trace with hash -912303337, now seen corresponding path program 1 times [2021-12-14 19:52:41,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:41,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551073674] [2021-12-14 19:52:41,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:41,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 19:52:41,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:41,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551073674] [2021-12-14 19:52:41,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551073674] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:41,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799551307] [2021-12-14 19:52:41,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:41,365 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:41,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:41,366 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-14 19:52:41,367 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-14 19:52:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:41,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 81 conjunts are in the unsatisfiable core [2021-12-14 19:52:41,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:41,487 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-14 19:52:41,513 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:52:41,513 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-14 19:52:41,623 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-14 19:52:41,870 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:41,871 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-14 19:52:41,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:41,947 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-14 19:52:42,094 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:42,094 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-14 19:52:42,181 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-14 19:52:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 19:52:42,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:44,414 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1661 Int)) (not (= (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_1661) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1661 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_1661) 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-14 19:52:44,460 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_1661 Int) (v_ArrVal_1660 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2021-12-14 19:52:44,492 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_1661 Int) (v_ArrVal_1660 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2021-12-14 19:52:44,514 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_1661 Int) (v_ArrVal_1660 (Array Int 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|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int 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|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1))))) is different from false [2021-12-14 19:52:44,565 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int 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_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (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_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2021-12-14 19:52:44,583 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int 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_1660) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (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_1660) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |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_34|))) is different from false [2021-12-14 19:52:44,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (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_1660) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int 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_1660) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2021-12-14 19:52:44,652 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_1661 Int) (v_ArrVal_1660 (Array Int 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|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) v_ArrVal_1660) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) v_ArrVal_1660) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))))) is different from false [2021-12-14 19:52:44,660 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:44,661 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-14 19:52:44,663 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-14 19:52:44,673 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:44,674 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-14 19:52:44,678 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-14 19:52:44,681 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-14 19:52:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2021-12-14 19:52:45,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799551307] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:45,016 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:45,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 54 [2021-12-14 19:52:45,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172204599] [2021-12-14 19:52:45,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:45,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-14 19:52:45,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:45,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-14 19:52:45,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2014, Unknown=8, NotChecked=776, Total=2970 [2021-12-14 19:52:45,018 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 0 states have call successors, (0), 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-14 19:52:47,282 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|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)))) (and (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (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|) 1) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |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_1661 Int) (v_ArrVal_1660 (Array Int 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|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) v_ArrVal_1660) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) v_ArrVal_1660) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (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|) 1))) is different from false