./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a --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 e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 14:04:11,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 14:04:11,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 14:04:11,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 14:04:11,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 14:04:11,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 14:04:11,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 14:04:11,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 14:04:11,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 14:04:11,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 14:04:11,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 14:04:11,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 14:04:11,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 14:04:11,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 14:04:11,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 14:04:11,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 14:04:11,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 14:04:11,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 14:04:11,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 14:04:11,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 14:04:11,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 14:04:11,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 14:04:11,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 14:04:11,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 14:04:11,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 14:04:11,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 14:04:11,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 14:04:11,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 14:04:11,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 14:04:11,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 14:04:11,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 14:04:11,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 14:04:11,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 14:04:11,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 14:04:11,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 14:04:11,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 14:04:11,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 14:04:11,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 14:04:11,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 14:04:11,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 14:04:11,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 14:04:11,774 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 14:04:11,793 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 14:04:11,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 14:04:11,794 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 14:04:11,794 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 14:04:11,795 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 14:04:11,795 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 14:04:11,796 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 14:04:11,796 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 14:04:11,796 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 14:04:11,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 14:04:11,797 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 14:04:11,797 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 14:04:11,797 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 14:04:11,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 14:04:11,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 14:04:11,798 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 14:04:11,798 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 14:04:11,798 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 14:04:11,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 14:04:11,799 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 14:04:11,799 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 14:04:11,799 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 14:04:11,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 14:04:11,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 14:04:11,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 14:04:11,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 14:04:11,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 14:04:11,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 14:04:11,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 14:04:11,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 14:04:11,801 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a 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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2022-11-21 14:04:12,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 14:04:12,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 14:04:12,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 14:04:12,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 14:04:12,067 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 14:04:12,068 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2022-11-21 14:04:15,175 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 14:04:15,431 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 14:04:15,432 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2022-11-21 14:04:15,445 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/data/3ec570446/00e39d34ad8c47efb7a9d30139931a55/FLAG132a63a86 [2022-11-21 14:04:15,460 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/data/3ec570446/00e39d34ad8c47efb7a9d30139931a55 [2022-11-21 14:04:15,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 14:04:15,464 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 14:04:15,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 14:04:15,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 14:04:15,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 14:04:15,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:04:15" (1/1) ... [2022-11-21 14:04:15,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e5e54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:15, skipping insertion in model container [2022-11-21 14:04:15,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:04:15" (1/1) ... [2022-11-21 14:04:15,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 14:04:15,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 14:04:15,875 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2022-11-21 14:04:15,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 14:04:15,891 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 14:04:15,967 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2022-11-21 14:04:15,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 14:04:16,005 INFO L208 MainTranslator]: Completed translation [2022-11-21 14:04:16,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:16 WrapperNode [2022-11-21 14:04:16,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 14:04:16,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 14:04:16,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 14:04:16,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 14:04:16,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:16" (1/1) ... [2022-11-21 14:04:16,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:16" (1/1) ... [2022-11-21 14:04:16,093 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 106 [2022-11-21 14:04:16,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 14:04:16,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 14:04:16,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 14:04:16,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 14:04:16,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:16" (1/1) ... [2022-11-21 14:04:16,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:16" (1/1) ... [2022-11-21 14:04:16,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:16" (1/1) ... [2022-11-21 14:04:16,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:16" (1/1) ... [2022-11-21 14:04:16,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:16" (1/1) ... [2022-11-21 14:04:16,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:16" (1/1) ... [2022-11-21 14:04:16,147 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:16" (1/1) ... [2022-11-21 14:04:16,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:16" (1/1) ... [2022-11-21 14:04:16,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 14:04:16,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 14:04:16,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 14:04:16,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 14:04:16,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:16" (1/1) ... [2022-11-21 14:04:16,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 14:04:16,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:04:16,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 14:04:16,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 14:04:16,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 14:04:16,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 14:04:16,226 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-21 14:04:16,226 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-21 14:04:16,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 14:04:16,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 14:04:16,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 14:04:16,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 14:04:16,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 14:04:16,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 14:04:16,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 14:04:16,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 14:04:16,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 14:04:16,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 14:04:16,362 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 14:04:16,364 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 14:04:16,749 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 14:04:16,756 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 14:04:16,757 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-21 14:04:16,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:04:16 BoogieIcfgContainer [2022-11-21 14:04:16,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 14:04:16,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 14:04:16,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 14:04:16,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 14:04:16,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 02:04:15" (1/3) ... [2022-11-21 14:04:16,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7913c850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:04:16, skipping insertion in model container [2022-11-21 14:04:16,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:04:16" (2/3) ... [2022-11-21 14:04:16,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7913c850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:04:16, skipping insertion in model container [2022-11-21 14:04:16,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:04:16" (3/3) ... [2022-11-21 14:04:16,775 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2022-11-21 14:04:16,794 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 14:04:16,795 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-11-21 14:04:16,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 14:04:16,845 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@780141b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 14:04:16,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-11-21 14:04:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:16,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-21 14:04:16,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:16,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:16,859 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:16,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1813073593, now seen corresponding path program 1 times [2022-11-21 14:04:16,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:16,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30020912] [2022-11-21 14:04:16,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:16,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:17,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:17,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30020912] [2022-11-21 14:04:17,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30020912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:17,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:17,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 14:04:17,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169642865] [2022-11-21 14:04:17,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:17,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 14:04:17,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:17,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 14:04:17,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 14:04:17,344 INFO L87 Difference]: Start difference. First operand has 73 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:17,433 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-11-21 14:04:17,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 14:04:17,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-21 14:04:17,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:17,443 INFO L225 Difference]: With dead ends: 71 [2022-11-21 14:04:17,443 INFO L226 Difference]: Without dead ends: 68 [2022-11-21 14:04:17,446 INFO L412 NwaCegarLoop]: 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 [2022-11-21 14:04:17,449 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:17,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:04:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-21 14:04:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-21 14:04:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.7) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-11-21 14:04:17,490 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 7 [2022-11-21 14:04:17,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:17,490 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-11-21 14:04:17,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-11-21 14:04:17,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-21 14:04:17,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:17,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:17,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 14:04:17,492 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:17,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:17,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1813073594, now seen corresponding path program 1 times [2022-11-21 14:04:17,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:17,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036169742] [2022-11-21 14:04:17,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:17,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:17,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:17,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036169742] [2022-11-21 14:04:17,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036169742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:17,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:17,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 14:04:17,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755429684] [2022-11-21 14:04:17,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:17,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 14:04:17,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:17,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 14:04:17,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 14:04:17,598 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:17,654 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-11-21 14:04:17,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 14:04:17,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-21 14:04:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:17,656 INFO L225 Difference]: With dead ends: 66 [2022-11-21 14:04:17,656 INFO L226 Difference]: Without dead ends: 66 [2022-11-21 14:04:17,657 INFO L412 NwaCegarLoop]: 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 [2022-11-21 14:04:17,658 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:17,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 108 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 14:04:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-21 14:04:17,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-21 14:04:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.65) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-11-21 14:04:17,666 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 7 [2022-11-21 14:04:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:17,666 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-11-21 14:04:17,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:04:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-11-21 14:04:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 14:04:17,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:17,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:17,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 14:04:17,668 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:17,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:17,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1431584192, now seen corresponding path program 1 times [2022-11-21 14:04:17,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:17,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622374078] [2022-11-21 14:04:17,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:17,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:17,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:17,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622374078] [2022-11-21 14:04:17,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622374078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:17,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:17,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:04:17,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892572804] [2022-11-21 14:04:17,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:17,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 14:04:17,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:17,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 14:04:17,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 14:04:17,918 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 14:04:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:18,146 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-11-21 14:04:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 14:04:18,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-21 14:04:18,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:18,153 INFO L225 Difference]: With dead ends: 70 [2022-11-21 14:04:18,153 INFO L226 Difference]: Without dead ends: 70 [2022-11-21 14:04:18,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 14:04:18,163 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 11 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:18,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 249 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 14:04:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-21 14:04:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-11-21 14:04:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.625) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-11-21 14:04:18,187 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 13 [2022-11-21 14:04:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:18,188 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-11-21 14:04:18,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 14:04:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-11-21 14:04:18,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 14:04:18,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:18,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:18,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 14:04:18,205 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:18,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:18,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1431584193, now seen corresponding path program 1 times [2022-11-21 14:04:18,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:18,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297511047] [2022-11-21 14:04:18,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:18,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:18,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:18,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297511047] [2022-11-21 14:04:18,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297511047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:18,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:18,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:04:18,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007407855] [2022-11-21 14:04:18,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:18,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 14:04:18,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:18,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 14:04:18,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 14:04:18,626 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 14:04:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:18,839 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-11-21 14:04:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 14:04:18,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-21 14:04:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:18,843 INFO L225 Difference]: With dead ends: 69 [2022-11-21 14:04:18,843 INFO L226 Difference]: Without dead ends: 69 [2022-11-21 14:04:18,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 14:04:18,854 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 9 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:18,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 265 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 14:04:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-21 14:04:18,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2022-11-21 14:04:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.6) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-11-21 14:04:18,869 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 13 [2022-11-21 14:04:18,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:18,869 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-11-21 14:04:18,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 14:04:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-11-21 14:04:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 14:04:18,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:18,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:18,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 14:04:18,872 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:18,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:18,873 INFO L85 PathProgramCache]: Analyzing trace with hash 869381824, now seen corresponding path program 1 times [2022-11-21 14:04:18,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:18,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077718888] [2022-11-21 14:04:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:18,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:18,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 14:04:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:18,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:18,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077718888] [2022-11-21 14:04:18,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077718888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:18,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:18,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 14:04:18,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840868949] [2022-11-21 14:04:18,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:18,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 14:04:18,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:18,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 14:04:18,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 14:04:18,970 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 14:04:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:19,038 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-11-21 14:04:19,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 14:04:19,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-21 14:04:19,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:19,044 INFO L225 Difference]: With dead ends: 70 [2022-11-21 14:04:19,044 INFO L226 Difference]: Without dead ends: 70 [2022-11-21 14:04:19,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 14:04:19,046 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:19,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 159 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:04:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-21 14:04:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-11-21 14:04:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-11-21 14:04:19,063 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 15 [2022-11-21 14:04:19,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:19,064 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-11-21 14:04:19,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 14:04:19,064 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-11-21 14:04:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 14:04:19,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:19,065 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:19,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 14:04:19,066 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:19,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:19,067 INFO L85 PathProgramCache]: Analyzing trace with hash -206453950, now seen corresponding path program 1 times [2022-11-21 14:04:19,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:19,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697160097] [2022-11-21 14:04:19,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:19,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:19,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:19,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 14:04:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 14:04:19,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:19,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697160097] [2022-11-21 14:04:19,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697160097] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:19,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446021376] [2022-11-21 14:04:19,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:19,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:04:19,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:04:19,222 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:04:19,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 14:04:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:19,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 14:04:19,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:04:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:04:19,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:04:19,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 14:04:19,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446021376] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:04:19,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 14:04:19,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-21 14:04:19,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820281366] [2022-11-21 14:04:19,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 14:04:19,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:04:19,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:19,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:04:19,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:04:19,484 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 14:04:19,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:19,568 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-11-21 14:04:19,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 14:04:19,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-11-21 14:04:19,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:19,569 INFO L225 Difference]: With dead ends: 71 [2022-11-21 14:04:19,569 INFO L226 Difference]: Without dead ends: 71 [2022-11-21 14:04:19,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:04:19,570 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:19,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 158 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:04:19,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-21 14:04:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-21 14:04:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:04:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-11-21 14:04:19,580 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 28 [2022-11-21 14:04:19,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:19,581 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-11-21 14:04:19,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 14:04:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-11-21 14:04:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 14:04:19,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:19,582 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:19,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 14:04:19,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:04:19,790 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:19,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:19,791 INFO L85 PathProgramCache]: Analyzing trace with hash 400923136, now seen corresponding path program 2 times [2022-11-21 14:04:19,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:19,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856184825] [2022-11-21 14:04:19,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:19,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:20,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:20,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:04:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:20,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:04:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-21 14:04:20,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:20,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856184825] [2022-11-21 14:04:20,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856184825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:20,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:20,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:04:20,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894507171] [2022-11-21 14:04:20,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:20,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 14:04:20,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:20,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 14:04:20,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 14:04:20,426 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:20,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:20,627 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-11-21 14:04:20,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:04:20,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-11-21 14:04:20,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:20,629 INFO L225 Difference]: With dead ends: 79 [2022-11-21 14:04:20,629 INFO L226 Difference]: Without dead ends: 79 [2022-11-21 14:04:20,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-21 14:04:20,630 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 87 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:20,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 147 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 14:04:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-21 14:04:20,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2022-11-21 14:04:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.434782608695652) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:04:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2022-11-21 14:04:20,641 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 41 [2022-11-21 14:04:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:20,642 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2022-11-21 14:04:20,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-11-21 14:04:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 14:04:20,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:20,651 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:20,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 14:04:20,651 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:20,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:20,652 INFO L85 PathProgramCache]: Analyzing trace with hash 400923137, now seen corresponding path program 1 times [2022-11-21 14:04:20,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:20,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388276441] [2022-11-21 14:04:20,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:20,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:21,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:21,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:04:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:21,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:04:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 14:04:21,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:21,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388276441] [2022-11-21 14:04:21,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388276441] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:21,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540136976] [2022-11-21 14:04:21,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:21,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:04:21,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:04:21,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:04:21,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 14:04:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:21,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 14:04:21,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:04:21,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 14:04:21,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 14:04:21,882 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_452 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_452))))) is different from true [2022-11-21 14:04:21,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:21,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 14:04:21,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 14:04:22,011 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_453 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_453) |c_#length|)))) is different from true [2022-11-21 14:04:22,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:22,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 14:04:22,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 14:04:22,157 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_454 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_454) |c_#length|)))) is different from true [2022-11-21 14:04:22,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:22,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 14:04:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2022-11-21 14:04:22,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:04:22,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540136976] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:22,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:04:22,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2022-11-21 14:04:22,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611933617] [2022-11-21 14:04:22,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:04:22,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 14:04:22,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:22,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 14:04:22,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=225, Unknown=3, NotChecked=96, Total=380 [2022-11-21 14:04:22,344 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 14:04:22,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:22,704 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-11-21 14:04:22,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 14:04:22,704 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-11-21 14:04:22,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:22,705 INFO L225 Difference]: With dead ends: 75 [2022-11-21 14:04:22,705 INFO L226 Difference]: Without dead ends: 75 [2022-11-21 14:04:22,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=341, Unknown=3, NotChecked=120, Total=552 [2022-11-21 14:04:22,706 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 258 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:22,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 144 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 177 Invalid, 0 Unknown, 162 Unchecked, 0.2s Time] [2022-11-21 14:04:22,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-21 14:04:22,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2022-11-21 14:04:22,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:04:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-11-21 14:04:22,711 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 41 [2022-11-21 14:04:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:22,711 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-11-21 14:04:22,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 14:04:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-11-21 14:04:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-21 14:04:22,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:22,712 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:22,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 14:04:22,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:04:22,919 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:22,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:22,920 INFO L85 PathProgramCache]: Analyzing trace with hash -456284671, now seen corresponding path program 1 times [2022-11-21 14:04:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:22,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431667672] [2022-11-21 14:04:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:22,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:23,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:23,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:04:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:23,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:04:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-21 14:04:23,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:23,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431667672] [2022-11-21 14:04:23,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431667672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:23,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:23,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:04:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815454856] [2022-11-21 14:04:23,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:23,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 14:04:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:23,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 14:04:23,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 14:04:23,187 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 14:04:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:23,303 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-11-21 14:04:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 14:04:23,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-11-21 14:04:23,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:23,305 INFO L225 Difference]: With dead ends: 62 [2022-11-21 14:04:23,305 INFO L226 Difference]: Without dead ends: 62 [2022-11-21 14:04:23,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 14:04:23,306 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 39 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:23,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 181 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:04:23,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-21 14:04:23,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-21 14:04:23,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.326086956521739) internal successors, (61), 57 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:04:23,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-11-21 14:04:23,310 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 42 [2022-11-21 14:04:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:23,310 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-11-21 14:04:23,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 14:04:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-11-21 14:04:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-21 14:04:23,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:23,311 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:23,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 14:04:23,311 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:23,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:23,312 INFO L85 PathProgramCache]: Analyzing trace with hash -456284672, now seen corresponding path program 1 times [2022-11-21 14:04:23,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:23,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279435393] [2022-11-21 14:04:23,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:23,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:23,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:23,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:04:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:23,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:04:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 14:04:23,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:23,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279435393] [2022-11-21 14:04:23,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279435393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:23,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:23,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:04:23,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542881622] [2022-11-21 14:04:23,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:23,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 14:04:23,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:23,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 14:04:23,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 14:04:23,496 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 14:04:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:23,620 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2022-11-21 14:04:23,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 14:04:23,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-11-21 14:04:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:23,621 INFO L225 Difference]: With dead ends: 73 [2022-11-21 14:04:23,621 INFO L226 Difference]: Without dead ends: 73 [2022-11-21 14:04:23,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 14:04:23,622 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 36 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:23,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 174 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:04:23,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-21 14:04:23,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2022-11-21 14:04:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:04:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-11-21 14:04:23,626 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 42 [2022-11-21 14:04:23,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:23,626 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-11-21 14:04:23,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 14:04:23,627 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-11-21 14:04:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-21 14:04:23,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:23,628 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:23,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 14:04:23,628 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:23,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:23,629 INFO L85 PathProgramCache]: Analyzing trace with hash 866562379, now seen corresponding path program 1 times [2022-11-21 14:04:23,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:23,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044938770] [2022-11-21 14:04:23,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:23,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:23,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:23,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:04:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:23,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:04:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 14:04:24,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:24,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044938770] [2022-11-21 14:04:24,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044938770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:24,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:24,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 14:04:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998268627] [2022-11-21 14:04:24,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:24,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 14:04:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:24,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 14:04:24,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-21 14:04:24,013 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:24,240 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-11-21 14:04:24,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 14:04:24,241 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-11-21 14:04:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:24,242 INFO L225 Difference]: With dead ends: 92 [2022-11-21 14:04:24,242 INFO L226 Difference]: Without dead ends: 92 [2022-11-21 14:04:24,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-21 14:04:24,243 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 192 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:24,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 215 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 14:04:24,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-21 14:04:24,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2022-11-21 14:04:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:04:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-11-21 14:04:24,247 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 49 [2022-11-21 14:04:24,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:24,247 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-11-21 14:04:24,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:24,247 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-11-21 14:04:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-21 14:04:24,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:24,248 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:24,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 14:04:24,248 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:24,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash 866562380, now seen corresponding path program 1 times [2022-11-21 14:04:24,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:24,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600939432] [2022-11-21 14:04:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:24,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:24,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:24,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:04:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:24,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:04:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-21 14:04:24,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:24,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600939432] [2022-11-21 14:04:24,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600939432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:24,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:24,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 14:04:24,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713872795] [2022-11-21 14:04:24,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:24,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 14:04:24,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:24,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 14:04:24,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-21 14:04:24,800 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:25,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:25,088 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-11-21 14:04:25,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 14:04:25,089 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-11-21 14:04:25,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:25,089 INFO L225 Difference]: With dead ends: 84 [2022-11-21 14:04:25,090 INFO L226 Difference]: Without dead ends: 84 [2022-11-21 14:04:25,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-21 14:04:25,091 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 193 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:25,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 233 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 14:04:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-21 14:04:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2022-11-21 14:04:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.28) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:04:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-21 14:04:25,095 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 49 [2022-11-21 14:04:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:25,095 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-21 14:04:25,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:25,096 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-21 14:04:25,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-21 14:04:25,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:25,097 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:25,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 14:04:25,097 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:25,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:25,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1093628647, now seen corresponding path program 1 times [2022-11-21 14:04:25,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:25,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372303553] [2022-11-21 14:04:25,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:25,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:25,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:25,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:04:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:25,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:04:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-21 14:04:25,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:25,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372303553] [2022-11-21 14:04:25,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372303553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:25,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:25,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 14:04:25,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305325851] [2022-11-21 14:04:25,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:25,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 14:04:25,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:25,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 14:04:25,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-21 14:04:25,440 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:25,617 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-11-21 14:04:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 14:04:25,618 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-11-21 14:04:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:25,618 INFO L225 Difference]: With dead ends: 67 [2022-11-21 14:04:25,618 INFO L226 Difference]: Without dead ends: 67 [2022-11-21 14:04:25,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-21 14:04:25,619 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 86 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:25,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 291 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:04:25,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-21 14:04:25,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-11-21 14:04:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.26) internal successors, (63), 59 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:04:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2022-11-21 14:04:25,623 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 50 [2022-11-21 14:04:25,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:25,623 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2022-11-21 14:04:25,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:25,623 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-11-21 14:04:25,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-21 14:04:25,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:25,624 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:25,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 14:04:25,625 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:25,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:25,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1290611022, now seen corresponding path program 1 times [2022-11-21 14:04:25,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:25,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632638144] [2022-11-21 14:04:25,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:25,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:26,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:26,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:04:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:26,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:04:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-21 14:04:26,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:26,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632638144] [2022-11-21 14:04:26,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632638144] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:04:26,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:04:26,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-21 14:04:26,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693023271] [2022-11-21 14:04:26,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:04:26,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 14:04:26,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:26,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 14:04:26,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-21 14:04:26,495 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:26,926 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-21 14:04:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 14:04:26,927 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-11-21 14:04:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:26,928 INFO L225 Difference]: With dead ends: 65 [2022-11-21 14:04:26,928 INFO L226 Difference]: Without dead ends: 65 [2022-11-21 14:04:26,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-11-21 14:04:26,928 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 156 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:26,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 277 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 14:04:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-21 14:04:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-21 14:04:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:04:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-11-21 14:04:26,930 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 53 [2022-11-21 14:04:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:26,931 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-11-21 14:04:26,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:04:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-11-21 14:04:26,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-21 14:04:26,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:26,932 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:26,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 14:04:26,932 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:26,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1354235562, now seen corresponding path program 1 times [2022-11-21 14:04:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:26,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613236274] [2022-11-21 14:04:26,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:26,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:28,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:28,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:04:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:28,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:04:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 14:04:28,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:28,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613236274] [2022-11-21 14:04:28,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613236274] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:28,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760101949] [2022-11-21 14:04:28,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:28,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:04:28,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:04:28,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:04:28,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 14:04:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:28,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-21 14:04:28,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:04:29,506 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 5 [2022-11-21 14:04:29,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 14:04:30,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:30,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:30,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-11-21 14:04:30,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:30,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:30,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2022-11-21 14:04:30,083 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-21 14:04:30,084 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 29 [2022-11-21 14:04:30,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:30,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:04:30,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2022-11-21 14:04:30,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:30,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:04:30,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-21 14:04:30,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:30,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-11-21 14:04:30,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:30,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-21 14:04:31,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:04:31,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:31,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:04:31,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 40 [2022-11-21 14:04:31,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:31,038 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 14:04:31,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-11-21 14:04:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 14:04:31,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:04:33,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760101949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:33,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:04:33,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 50 [2022-11-21 14:04:33,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516765182] [2022-11-21 14:04:33,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:04:33,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-21 14:04:33,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:33,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-21 14:04:33,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3687, Unknown=0, NotChecked=0, Total=3906 [2022-11-21 14:04:33,669 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 51 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 45 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 14:04:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:37,368 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-11-21 14:04:37,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-21 14:04:37,369 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 45 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-11-21 14:04:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:37,371 INFO L225 Difference]: With dead ends: 105 [2022-11-21 14:04:37,372 INFO L226 Difference]: Without dead ends: 105 [2022-11-21 14:04:37,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1672 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=659, Invalid=6651, Unknown=0, NotChecked=0, Total=7310 [2022-11-21 14:04:37,378 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 585 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:37,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 616 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-21 14:04:37,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-21 14:04:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2022-11-21 14:04:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 62 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:04:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-11-21 14:04:37,389 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 54 [2022-11-21 14:04:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:37,390 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-11-21 14:04:37,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 45 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 14:04:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-11-21 14:04:37,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-21 14:04:37,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:37,392 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:37,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 14:04:37,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-21 14:04:37,595 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:37,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:37,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1354235561, now seen corresponding path program 1 times [2022-11-21 14:04:37,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:37,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260159090] [2022-11-21 14:04:37,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:37,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:39,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:39,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:04:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:39,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:04:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 14:04:39,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:39,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260159090] [2022-11-21 14:04:39,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260159090] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:39,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371030916] [2022-11-21 14:04:39,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:39,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:04:39,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:04:39,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:04:39,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 14:04:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:40,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-21 14:04:40,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:04:40,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-21 14:04:40,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 14:04:41,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:41,174 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 25 [2022-11-21 14:04:41,193 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 14:04:41,193 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-21 14:04:41,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 14:04:41,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:41,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 14:04:41,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:41,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-21 14:04:41,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:41,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 14:04:41,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:41,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-11-21 14:04:41,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:41,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-11-21 14:04:42,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:04:42,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:42,164 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:04:42,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 40 [2022-11-21 14:04:42,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:42,178 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 14:04:42,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-11-21 14:04:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 14:04:42,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:04:44,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371030916] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:44,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:04:44,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2022-11-21 14:04:44,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849996512] [2022-11-21 14:04:44,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:04:44,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-21 14:04:44,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:44,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-21 14:04:44,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3468, Unknown=1, NotChecked=0, Total=3660 [2022-11-21 14:04:44,480 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 49 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 14:04:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:49,563 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-11-21 14:04:49,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-21 14:04:49,564 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-11-21 14:04:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:49,565 INFO L225 Difference]: With dead ends: 91 [2022-11-21 14:04:49,565 INFO L226 Difference]: Without dead ends: 91 [2022-11-21 14:04:49,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=572, Invalid=6735, Unknown=3, NotChecked=0, Total=7310 [2022-11-21 14:04:49,568 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 670 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:49,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 732 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1351 Invalid, 2 Unknown, 0 Unchecked, 1.4s Time] [2022-11-21 14:04:49,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-21 14:04:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2022-11-21 14:04:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 64 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:04:49,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-11-21 14:04:49,574 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 54 [2022-11-21 14:04:49,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:49,574 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-11-21 14:04:49,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 14:04:49,575 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-11-21 14:04:49,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-21 14:04:49,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:49,576 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:04:49,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 14:04:49,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:04:49,779 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:49,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:49,779 INFO L85 PathProgramCache]: Analyzing trace with hash 968369212, now seen corresponding path program 1 times [2022-11-21 14:04:49,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:49,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699032757] [2022-11-21 14:04:49,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:49,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:50,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:50,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:04:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:51,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:04:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 14:04:51,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:51,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699032757] [2022-11-21 14:04:51,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699032757] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:51,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072216602] [2022-11-21 14:04:51,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:51,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:04:51,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:04:51,259 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:04:51,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 14:04:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:51,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-21 14:04:51,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:04:51,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-21 14:04:52,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:52,088 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 12 [2022-11-21 14:04:52,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:52,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-21 14:04:52,418 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-21 14:04:52,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:52,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2022-11-21 14:04:52,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 14:04:52,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:04:52,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:52,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:04:52,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 19 [2022-11-21 14:04:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 14:04:52,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:04:52,923 INFO L350 Elim1Store]: Elim1 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 114 treesize of output 106 [2022-11-21 14:04:53,799 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (not .cse0) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| Int) (v_ArrVal_1695 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| |c_#StackHeapBarrier|)) (not (= (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (store v_ArrVal_1695 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_1695) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 4) 0)))) (not .cse3)) (or (and .cse0 .cse3) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| Int) (v_ArrVal_1695 (Array Int Int)) (v_arrayElimCell_55 Int)) (or (not (= (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (store v_ArrVal_1695 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_1695) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_55)) 0)) (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| |c_#StackHeapBarrier|)) (<= (+ v_arrayElimCell_55 1) 0)))))) is different from false [2022-11-21 14:04:53,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072216602] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:53,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:04:53,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 42 [2022-11-21 14:04:53,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138822208] [2022-11-21 14:04:53,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:04:53,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-21 14:04:53,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:04:53,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-21 14:04:53,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2104, Unknown=1, NotChecked=92, Total=2352 [2022-11-21 14:04:53,808 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 42 states, 40 states have (on average 1.95) internal successors, (78), 36 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 14:04:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:04:55,577 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-11-21 14:04:55,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-21 14:04:55,578 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.95) internal successors, (78), 36 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2022-11-21 14:04:55,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:04:55,579 INFO L225 Difference]: With dead ends: 72 [2022-11-21 14:04:55,579 INFO L226 Difference]: Without dead ends: 72 [2022-11-21 14:04:55,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=508, Invalid=4051, Unknown=1, NotChecked=132, Total=4692 [2022-11-21 14:04:55,581 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 463 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 14:04:55,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 639 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 14:04:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-21 14:04:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-11-21 14:04:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:04:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-11-21 14:04:55,584 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 55 [2022-11-21 14:04:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:04:55,585 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-11-21 14:04:55,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.95) internal successors, (78), 36 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 14:04:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-11-21 14:04:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 14:04:55,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:04:55,586 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-21 14:04:55,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-21 14:04:55,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 14:04:55,792 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:04:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:04:55,793 INFO L85 PathProgramCache]: Analyzing trace with hash -567858883, now seen corresponding path program 1 times [2022-11-21 14:04:55,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:04:55,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828363684] [2022-11-21 14:04:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:55,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:04:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:04:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:57,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:04:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:57,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:04:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 14:04:58,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:04:58,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828363684] [2022-11-21 14:04:58,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828363684] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:04:58,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246779537] [2022-11-21 14:04:58,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:04:58,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:04:58,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:04:58,750 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:04:58,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 14:04:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:04:58,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-21 14:04:58,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:04:59,168 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-21 14:04:59,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:04:59,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 14:04:59,867 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 18 [2022-11-21 14:04:59,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 14:04:59,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 14:04:59,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 14:05:00,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:00,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-21 14:05:00,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:00,316 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 29 [2022-11-21 14:05:00,335 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-21 14:05:00,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2022-11-21 14:05:00,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 14:05:00,361 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 14:05:00,362 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-21 14:05:00,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:00,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2022-11-21 14:05:00,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 14:05:00,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:00,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-21 14:05:01,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:01,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2022-11-21 14:05:01,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:01,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-21 14:05:01,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:01,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-21 14:05:01,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:05:01,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:01,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:05:01,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 47 [2022-11-21 14:05:01,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:01,543 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 14:05:01,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-11-21 14:05:01,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 14:05:01,916 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 14:05:01,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:05:04,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246779537] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:05:04,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:05:04,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 51 [2022-11-21 14:05:04,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144941818] [2022-11-21 14:05:04,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:05:04,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-21 14:05:04,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:05:04,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-21 14:05:04,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=3601, Unknown=0, NotChecked=0, Total=3782 [2022-11-21 14:05:04,282 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 51 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 45 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 14:05:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:05:08,291 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-11-21 14:05:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-21 14:05:08,291 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 45 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2022-11-21 14:05:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:05:08,292 INFO L225 Difference]: With dead ends: 70 [2022-11-21 14:05:08,292 INFO L226 Difference]: Without dead ends: 70 [2022-11-21 14:05:08,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=458, Invalid=6682, Unknown=0, NotChecked=0, Total=7140 [2022-11-21 14:05:08,295 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 295 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-21 14:05:08,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 801 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-21 14:05:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-21 14:05:08,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-21 14:05:08,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:05:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-21 14:05:08,298 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 58 [2022-11-21 14:05:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:05:08,299 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-21 14:05:08,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 45 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 14:05:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-21 14:05:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 14:05:08,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:05:08,300 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-11-21 14:05:08,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 14:05:08,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 14:05:08,512 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:05:08,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:05:08,513 INFO L85 PathProgramCache]: Analyzing trace with hash -423755733, now seen corresponding path program 2 times [2022-11-21 14:05:08,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:05:08,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46462494] [2022-11-21 14:05:08,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:05:08,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:05:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:05:10,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:05:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:05:10,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:05:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:05:11,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:05:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:05:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 14:05:11,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:05:11,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46462494] [2022-11-21 14:05:11,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46462494] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:05:11,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797019900] [2022-11-21 14:05:11,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 14:05:11,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:05:11,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:05:11,863 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:05:11,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 14:05:12,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 14:05:12,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:05:12,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-21 14:05:12,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:05:12,627 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-21 14:05:12,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2022-11-21 14:05:12,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 14:05:13,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:05:13,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2022-11-21 14:05:13,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 14:05:13,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 14:05:13,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:13,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 14:05:13,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:13,896 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 14:05:13,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 50 [2022-11-21 14:05:13,937 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-21 14:05:13,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2022-11-21 14:05:14,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:14,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-21 14:05:14,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:14,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:05:14,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:14,504 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 14:05:14,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 54 [2022-11-21 14:05:14,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:14,775 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 14:05:14,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 51 [2022-11-21 14:05:14,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:14,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-21 14:05:15,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:15,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:05:15,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 21 [2022-11-21 14:05:16,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:05:16,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:05:16,272 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-21 14:05:16,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 125 treesize of output 56 [2022-11-21 14:05:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:05:16,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:05:22,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797019900] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:05:22,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:05:22,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 32] total 66 [2022-11-21 14:05:22,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066767255] [2022-11-21 14:05:22,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:05:22,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-21 14:05:22,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:05:22,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-21 14:05:22,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=6206, Unknown=3, NotChecked=0, Total=6480 [2022-11-21 14:05:22,051 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 67 states, 64 states have (on average 1.625) internal successors, (104), 59 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 14:05:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:05:33,070 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-11-21 14:05:33,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-21 14:05:33,071 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 64 states have (on average 1.625) internal successors, (104), 59 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2022-11-21 14:05:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:05:33,072 INFO L225 Difference]: With dead ends: 109 [2022-11-21 14:05:33,072 INFO L226 Difference]: Without dead ends: 109 [2022-11-21 14:05:33,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2396 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=1064, Invalid=11143, Unknown=3, NotChecked=0, Total=12210 [2022-11-21 14:05:33,076 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 846 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 55 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-21 14:05:33,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 747 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1913 Invalid, 2 Unknown, 0 Unchecked, 2.3s Time] [2022-11-21 14:05:33,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-21 14:05:33,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 72. [2022-11-21 14:05:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:05:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-11-21 14:05:33,080 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 59 [2022-11-21 14:05:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:05:33,080 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-11-21 14:05:33,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 64 states have (on average 1.625) internal successors, (104), 59 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 14:05:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-11-21 14:05:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 14:05:33,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:05:33,081 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-11-21 14:05:33,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 14:05:33,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:05:33,287 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:05:33,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:05:33,287 INFO L85 PathProgramCache]: Analyzing trace with hash -423755732, now seen corresponding path program 2 times [2022-11-21 14:05:33,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:05:33,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804304129] [2022-11-21 14:05:33,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:05:33,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:05:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:05:35,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:05:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:05:35,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:05:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:05:36,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:05:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:05:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 14:05:36,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:05:36,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804304129] [2022-11-21 14:05:36,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804304129] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:05:36,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652884463] [2022-11-21 14:05:36,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 14:05:36,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:05:36,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:05:36,952 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:05:36,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 14:05:37,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 14:05:37,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:05:37,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 147 conjunts are in the unsatisfiable core [2022-11-21 14:05:37,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:05:37,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 14:05:37,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 14:05:37,362 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2288 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_2288))) is different from true [2022-11-21 14:05:37,374 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2288 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_2288))) is different from true [2022-11-21 14:05:37,392 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 14:05:37,392 INFO L350 Elim1Store]: Elim1 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 [2022-11-21 14:05:37,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 14:05:37,763 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 14:05:37,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 14:05:38,054 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-21 14:05:38,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-11-21 14:05:38,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 14:05:38,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 14:05:38,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 14:05:39,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:05:39,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2022-11-21 14:05:39,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 14:05:39,048 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 14:05:39,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-11-21 14:05:39,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:39,707 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 14:05:39,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 75 [2022-11-21 14:05:39,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:39,732 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 14:05:39,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 57 [2022-11-21 14:05:39,751 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-21 14:05:39,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 38 [2022-11-21 14:05:39,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 14:05:39,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:39,834 INFO L321 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-11-21 14:05:39,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2022-11-21 14:05:40,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:40,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:40,425 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 14:05:40,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 61 [2022-11-21 14:05:40,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:40,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2022-11-21 14:05:40,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:40,656 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 14:05:40,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 60 [2022-11-21 14:05:40,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:40,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:40,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 68 [2022-11-21 14:05:40,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-11-21 14:05:42,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:05:42,218 INFO L321 Elim1Store]: treesize reduction 63, result has 20.3 percent of original size [2022-11-21 14:05:42,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 196 treesize of output 102 [2022-11-21 14:05:42,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:05:42,238 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:05:42,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-11-21 14:05:43,089 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 12 refuted. 6 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-21 14:05:43,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:05:53,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652884463] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:05:53,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:05:53,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 72 [2022-11-21 14:05:53,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887448571] [2022-11-21 14:05:53,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:05:53,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-21 14:05:53,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:05:53,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-21 14:05:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=7191, Unknown=19, NotChecked=342, Total=7832 [2022-11-21 14:05:53,160 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 73 states, 70 states have (on average 1.5) internal successors, (105), 63 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 14:06:10,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:06:10,406 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2022-11-21 14:06:10,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-21 14:06:10,406 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 70 states have (on average 1.5) internal successors, (105), 63 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2022-11-21 14:06:10,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:06:10,407 INFO L225 Difference]: With dead ends: 124 [2022-11-21 14:06:10,407 INFO L226 Difference]: Without dead ends: 124 [2022-11-21 14:06:10,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2813 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=1004, Invalid=13505, Unknown=19, NotChecked=478, Total=15006 [2022-11-21 14:06:10,409 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1015 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 2992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-21 14:06:10,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 1074 Invalid, 2992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2714 Invalid, 1 Unknown, 218 Unchecked, 4.0s Time] [2022-11-21 14:06:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-21 14:06:10,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 74. [2022-11-21 14:06:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:06:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-11-21 14:06:10,413 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 59 [2022-11-21 14:06:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:06:10,414 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-11-21 14:06:10,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 70 states have (on average 1.5) internal successors, (105), 63 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 14:06:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-11-21 14:06:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-21 14:06:10,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:06:10,415 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-21 14:06:10,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 14:06:10,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:06:10,619 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:06:10,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:06:10,619 INFO L85 PathProgramCache]: Analyzing trace with hash -251527161, now seen corresponding path program 2 times [2022-11-21 14:06:10,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:06:10,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890568876] [2022-11-21 14:06:10,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:06:10,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:06:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:06:12,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:06:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:06:12,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:06:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:06:13,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:06:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:06:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 14:06:13,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:06:13,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890568876] [2022-11-21 14:06:13,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890568876] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:06:13,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541973789] [2022-11-21 14:06:13,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 14:06:13,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:06:13,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:06:13,644 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:06:13,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 14:06:13,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 14:06:13,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:06:13,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 141 conjunts are in the unsatisfiable core [2022-11-21 14:06:13,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:06:13,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 14:06:14,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 14:06:14,074 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2497 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_2497)))) is different from true [2022-11-21 14:06:14,092 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_#res#1.base| 0)) (exists ((v_ArrVal_2497 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_2497)))) is different from true [2022-11-21 14:06:14,117 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 14:06:14,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-21 14:06:14,494 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 14:06:14,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 14:06:14,651 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 14:06:14,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 14:06:14,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 14:06:15,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:06:15,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 21 [2022-11-21 14:06:15,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 14:06:15,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:15,678 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-21 14:06:15,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 43 [2022-11-21 14:06:15,696 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 14:06:15,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-21 14:06:15,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:15,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-21 14:06:16,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:16,096 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:06:16,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:16,107 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 14:06:16,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 43 [2022-11-21 14:06:16,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:16,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-21 14:06:16,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:16,324 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 14:06:16,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 40 [2022-11-21 14:06:16,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:16,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-21 14:06:16,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:16,772 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 14:06:16,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2022-11-21 14:06:17,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:06:17,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:17,316 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-21 14:06:17,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 34 [2022-11-21 14:06:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-21 14:06:17,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:06:19,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541973789] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:06:19,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:06:19,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 67 [2022-11-21 14:06:19,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659556347] [2022-11-21 14:06:19,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:06:19,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-21 14:06:19,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:06:19,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-21 14:06:19,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=5457, Unknown=2, NotChecked=298, Total=6006 [2022-11-21 14:06:19,256 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 67 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 58 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 14:06:27,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:06:27,360 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-11-21 14:06:27,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-21 14:06:27,360 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 58 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 60 [2022-11-21 14:06:27,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:06:27,361 INFO L225 Difference]: With dead ends: 93 [2022-11-21 14:06:27,361 INFO L226 Difference]: Without dead ends: 93 [2022-11-21 14:06:27,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2827 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=913, Invalid=10865, Unknown=2, NotChecked=430, Total=12210 [2022-11-21 14:06:27,363 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 476 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1916 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-21 14:06:27,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1027 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1916 Invalid, 0 Unknown, 176 Unchecked, 1.7s Time] [2022-11-21 14:06:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-21 14:06:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2022-11-21 14:06:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 69 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:06:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-11-21 14:06:27,367 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 60 [2022-11-21 14:06:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:06:27,367 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-11-21 14:06:27,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 58 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 14:06:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-11-21 14:06:27,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-21 14:06:27,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:06:27,369 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:06:27,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 14:06:27,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-21 14:06:27,576 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:06:27,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:06:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1512551826, now seen corresponding path program 2 times [2022-11-21 14:06:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:06:27,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438230106] [2022-11-21 14:06:27,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:06:27,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:06:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:06:30,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:06:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:06:30,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:06:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:06:31,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:06:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:06:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 14:06:32,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:06:32,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438230106] [2022-11-21 14:06:32,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438230106] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:06:32,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023246901] [2022-11-21 14:06:32,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 14:06:32,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:06:32,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:06:32,260 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:06:32,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 14:06:32,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 14:06:32,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:06:32,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 190 conjunts are in the unsatisfiable core [2022-11-21 14:06:32,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:06:32,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 14:06:32,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 14:06:32,869 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-21 14:06:33,120 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 14:06:33,120 INFO L350 Elim1Store]: Elim1 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 [2022-11-21 14:06:33,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:33,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 14:06:33,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 14:06:34,199 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 14:06:34,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 14:06:34,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 14:06:34,233 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 14:06:34,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 14:06:34,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 14:06:34,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-21 14:06:34,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 14:06:35,228 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:06:35,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 35 [2022-11-21 14:06:35,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 14:06:35,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 14:06:35,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 14:06:36,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:36,032 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 14:06:36,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 66 [2022-11-21 14:06:36,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:36,066 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 14:06:36,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2022-11-21 14:06:36,099 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 14:06:36,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-21 14:06:36,130 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-21 14:06:36,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2022-11-21 14:06:36,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 14:06:36,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:36,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:06:36,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:36,909 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 14:06:36,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 61 [2022-11-21 14:06:36,940 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-21 14:06:36,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 48 [2022-11-21 14:06:36,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:36,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:36,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-11-21 14:06:37,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:37,274 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 14:06:37,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 58 [2022-11-21 14:06:37,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:37,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:37,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2022-11-21 14:06:37,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2022-11-21 14:06:40,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:06:40,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:40,204 INFO L321 Elim1Store]: treesize reduction 58, result has 21.6 percent of original size [2022-11-21 14:06:40,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 194 treesize of output 104 [2022-11-21 14:06:40,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:40,229 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-21 14:06:40,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 39 [2022-11-21 14:06:41,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:06:41,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-11-21 14:06:41,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 14:06:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:06:41,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:06:46,111 INFO L350 Elim1Store]: Elim1 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 706 treesize of output 562 [2022-11-21 14:06:51,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023246901] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:06:51,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:06:51,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 42] total 79 [2022-11-21 14:06:51,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315046238] [2022-11-21 14:06:51,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:06:51,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-21 14:06:51,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:06:51,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-21 14:06:51,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=8831, Unknown=14, NotChecked=0, Total=9120 [2022-11-21 14:06:51,982 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 79 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 69 states have internal predecessors, (112), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 14:07:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:07:10,423 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-11-21 14:07:10,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-21 14:07:10,424 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 69 states have internal predecessors, (112), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2022-11-21 14:07:10,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:07:10,425 INFO L225 Difference]: With dead ends: 91 [2022-11-21 14:07:10,425 INFO L226 Difference]: Without dead ends: 91 [2022-11-21 14:07:10,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2394 ImplicationChecksByTransitivity, 31.9s TimeCoverageRelationStatistics Valid=959, Invalid=16056, Unknown=15, NotChecked=0, Total=17030 [2022-11-21 14:07:10,427 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 473 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 3187 mSolverCounterSat, 44 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 3233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3187 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-21 14:07:10,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1110 Invalid, 3233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3187 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-11-21 14:07:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-21 14:07:10,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2022-11-21 14:07:10,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 14:07:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-11-21 14:07:10,431 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 63 [2022-11-21 14:07:10,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:07:10,431 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-11-21 14:07:10,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 69 states have internal predecessors, (112), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 14:07:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-11-21 14:07:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-21 14:07:10,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:07:10,432 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:07:10,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 14:07:10,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:07:10,635 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:07:10,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:07:10,635 INFO L85 PathProgramCache]: Analyzing trace with hash -355533194, now seen corresponding path program 3 times [2022-11-21 14:07:10,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:07:10,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619452553] [2022-11-21 14:07:10,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:07:10,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:07:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:07:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:14,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:07:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:14,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:07:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 14:07:15,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:07:15,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619452553] [2022-11-21 14:07:15,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619452553] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:07:15,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916825926] [2022-11-21 14:07:15,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 14:07:15,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:07:15,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:07:15,464 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:07:15,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 14:07:16,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-21 14:07:16,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:07:16,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 190 conjunts are in the unsatisfiable core [2022-11-21 14:07:16,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:07:16,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 14:07:16,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 14:07:16,664 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 14:07:16,664 INFO L350 Elim1Store]: Elim1 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 [2022-11-21 14:07:16,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 14:07:16,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 14:07:17,478 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 14:07:17,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 14:07:17,502 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-21 14:07:17,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2022-11-21 14:07:17,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 14:07:17,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 14:07:17,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-21 14:07:18,412 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-21 14:07:18,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 47 [2022-11-21 14:07:18,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:07:18,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-21 14:07:18,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 14:07:18,906 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-21 14:07:18,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-21 14:07:19,229 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse0 (<= (+ 2 .cse2) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2))) (.cse3 (not (= .cse6 .cse2))) (.cse4 (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (.cse5 (= (select (select |c_#memory_$Pointer$.base| .cse6) 4) 0)) (.cse7 (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or (and .cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) .cse3 .cse4 .cse5 (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) .cse7) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse9 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse10 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse9) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (not (= .cse9 .cse10)) (<= (+ .cse9 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse9) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse10) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse10) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse8) (not (= .cse10 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse9 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse11 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse11 (select |c_#memory_$Pointer$.offset| .cse11))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse0 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse12 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse2) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse6) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse12 (select |c_#memory_$Pointer$.offset| .cse12))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse1 .cse3 .cse4 .cse5 .cse7)))))) is different from false [2022-11-21 14:07:19,238 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse0 (<= (+ 2 .cse2) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2))) (.cse3 (not (= .cse6 .cse2))) (.cse4 (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (.cse5 (= (select (select |c_#memory_$Pointer$.base| .cse6) 4) 0)) (.cse7 (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or (and .cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) .cse3 .cse4 .cse5 (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) .cse7) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse9 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse10 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse9) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (not (= .cse9 .cse10)) (<= (+ .cse9 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse9) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse10) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse10) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse8) (not (= .cse10 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse9 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse11 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse11 (select |c_#memory_$Pointer$.offset| .cse11))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse0 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse12 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse2) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse6) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse12 (select |c_#memory_$Pointer$.offset| .cse12))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse1 .cse3 .cse4 .cse5 .cse7)))))) is different from true [2022-11-21 14:07:19,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:07:19,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:07:19,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2022-11-21 14:07:19,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:07:19,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:07:19,757 INFO L321 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2022-11-21 14:07:19,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 116 treesize of output 75 [2022-11-21 14:07:20,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:07:20,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:07:20,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:07:20,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2022-11-21 14:07:20,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:07:20,078 INFO L321 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2022-11-21 14:07:20,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 113 treesize of output 72 [2022-11-21 14:07:23,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:07:23,546 INFO L321 Elim1Store]: treesize reduction 218, result has 6.0 percent of original size [2022-11-21 14:07:23,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 21 case distinctions, treesize of input 246 treesize of output 113 [2022-11-21 14:07:23,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:07:23,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:07:23,577 INFO L321 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2022-11-21 14:07:23,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 36 [2022-11-21 14:07:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 14:07:23,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:07:42,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916825926] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:07:42,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:07:42,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 74 [2022-11-21 14:07:42,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460241647] [2022-11-21 14:07:42,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:07:42,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-21 14:07:42,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:07:42,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-21 14:07:42,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=7376, Unknown=5, NotChecked=172, Total=7832 [2022-11-21 14:07:42,298 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 74 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 65 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 14:07:45,829 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse13 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13)) (.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (.cse7 (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0)) (.cse12 (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)) (.cse8 (not (= .cse4 .cse3))) (.cse11 (= (select (select |c_#memory_$Pointer$.base| .cse4) 4) 0)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10)) (.cse17 (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (<= (+ 1 .cse3) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| .cse2) 4) 0) (= (select |c_#valid| .cse4) 1) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse5)) (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) .cse7 (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) .cse8 (not (= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse11 (= (select (select |c_#memory_$Pointer$.base| .cse9) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$.base| .cse5) 4) 0) (= (select |c_#valid| .cse3) 1) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse5) 1) (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse12 (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse6)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|) (let ((.cse14 (<= (+ 2 .cse3) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse3))) (.cse16 (not (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) (or (and .cse14 .cse1 .cse15 .cse7 .cse8 .cse16 .cse11 .cse12 .cse17) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse21 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse19 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse20 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse19) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse18 (select |c_#memory_$Pointer$.base| .cse18))) (not (= .cse19 .cse20)) (<= (+ .cse19 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse19) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse20) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse20) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse18) (not (= .cse20 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse19 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse21 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse21 (select |c_#memory_$Pointer$.offset| .cse21))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse14 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse22 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse22 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse3) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse4) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse22 (select |c_#memory_$Pointer$.offset| .cse22))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse15 .cse8 .cse16 .cse11 .cse17))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse9) 4) 0) (<= (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_sll_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| .cse9) 1) .cse17 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from false [2022-11-21 14:07:45,836 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse13 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13)) (.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (.cse7 (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0)) (.cse12 (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)) (.cse8 (not (= .cse4 .cse3))) (.cse11 (= (select (select |c_#memory_$Pointer$.base| .cse4) 4) 0)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10)) (.cse17 (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (<= (+ 1 .cse3) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| .cse2) 4) 0) (= (select |c_#valid| .cse4) 1) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse5)) (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) .cse7 (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) .cse8 (not (= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse11 (= (select (select |c_#memory_$Pointer$.base| .cse9) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$.base| .cse5) 4) 0) (= (select |c_#valid| .cse3) 1) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse5) 1) (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse12 (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse6)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|) (let ((.cse14 (<= (+ 2 .cse3) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse3))) (.cse16 (not (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) (or (and .cse14 .cse1 .cse15 .cse7 .cse8 .cse16 .cse11 .cse12 .cse17) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse21 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse19 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse20 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse19) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse18 (select |c_#memory_$Pointer$.base| .cse18))) (not (= .cse19 .cse20)) (<= (+ .cse19 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse19) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse20) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse20) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse18) (not (= .cse20 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse19 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse21 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse21 (select |c_#memory_$Pointer$.offset| .cse21))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse14 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse22 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse22 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse3) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse4) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse22 (select |c_#memory_$Pointer$.offset| .cse22))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse15 .cse8 .cse16 .cse11 .cse17))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse9) 4) 0) (<= (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_sll_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| .cse9) 1) .cse17 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from true [2022-11-21 14:07:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:07:54,836 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2022-11-21 14:07:54,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-21 14:07:54,837 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 65 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 64 [2022-11-21 14:07:54,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:07:54,838 INFO L225 Difference]: With dead ends: 132 [2022-11-21 14:07:54,838 INFO L226 Difference]: Without dead ends: 132 [2022-11-21 14:07:54,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 39 SyntacticMatches, 9 SemanticMatches, 115 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3353 ImplicationChecksByTransitivity, 32.8s TimeCoverageRelationStatistics Valid=587, Invalid=12524, Unknown=7, NotChecked=454, Total=13572 [2022-11-21 14:07:54,840 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 249 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 2564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-21 14:07:54,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1416 Invalid, 2564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2403 Invalid, 0 Unknown, 123 Unchecked, 4.5s Time] [2022-11-21 14:07:54,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-21 14:07:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 108. [2022-11-21 14:07:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.1521739130434783) internal successors, (106), 101 states have internal predecessors, (106), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 14:07:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2022-11-21 14:07:54,845 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 64 [2022-11-21 14:07:54,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:07:54,845 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2022-11-21 14:07:54,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 65 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 14:07:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2022-11-21 14:07:54,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-21 14:07:54,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:07:54,847 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:07:54,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 14:07:55,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:07:55,057 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:07:55,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:07:55,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1863371548, now seen corresponding path program 3 times [2022-11-21 14:07:55,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:07:55,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620808900] [2022-11-21 14:07:55,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:07:55,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:07:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:55,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:07:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:55,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:07:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:55,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:07:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:55,268 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-21 14:07:55,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:07:55,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620808900] [2022-11-21 14:07:55,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620808900] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:07:55,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209213725] [2022-11-21 14:07:55,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 14:07:55,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:07:55,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:07:55,270 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:07:55,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 14:07:56,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-21 14:07:56,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:07:56,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 14:07:56,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:07:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-21 14:07:56,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:07:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-21 14:07:56,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209213725] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:07:56,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 14:07:56,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-11-21 14:07:56,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259725323] [2022-11-21 14:07:56,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 14:07:56,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 14:07:56,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:07:56,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 14:07:56,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-21 14:07:56,572 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 14:07:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:07:56,692 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-11-21 14:07:56,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 14:07:56,693 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-11-21 14:07:56,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:07:56,694 INFO L225 Difference]: With dead ends: 119 [2022-11-21 14:07:56,694 INFO L226 Difference]: Without dead ends: 119 [2022-11-21 14:07:56,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-21 14:07:56,695 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 109 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:07:56,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 407 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:07:56,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-21 14:07:56,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2022-11-21 14:07:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 103 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 14:07:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2022-11-21 14:07:56,700 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 65 [2022-11-21 14:07:56,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:07:56,700 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2022-11-21 14:07:56,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 14:07:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2022-11-21 14:07:56,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-21 14:07:56,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:07:56,702 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:07:56,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-21 14:07:56,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:07:56,910 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:07:56,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:07:56,910 INFO L85 PathProgramCache]: Analyzing trace with hash -749426673, now seen corresponding path program 1 times [2022-11-21 14:07:56,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:07:56,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988652044] [2022-11-21 14:07:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:07:56,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:07:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:57,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:07:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:57,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:07:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:57,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:07:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-21 14:07:57,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:07:57,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988652044] [2022-11-21 14:07:57,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988652044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:07:57,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:07:57,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 14:07:57,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428677153] [2022-11-21 14:07:57,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:07:57,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 14:07:57,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:07:57,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 14:07:57,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-21 14:07:57,197 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:07:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:07:57,441 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2022-11-21 14:07:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 14:07:57,441 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2022-11-21 14:07:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:07:57,442 INFO L225 Difference]: With dead ends: 119 [2022-11-21 14:07:57,442 INFO L226 Difference]: Without dead ends: 119 [2022-11-21 14:07:57,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-21 14:07:57,443 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 87 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 14:07:57,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 225 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 14:07:57,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-21 14:07:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2022-11-21 14:07:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 104 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 14:07:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-11-21 14:07:57,448 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 68 [2022-11-21 14:07:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:07:57,448 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-11-21 14:07:57,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:07:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-11-21 14:07:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-21 14:07:57,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:07:57,450 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:07:57,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 14:07:57,450 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:07:57,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:07:57,451 INFO L85 PathProgramCache]: Analyzing trace with hash -749426672, now seen corresponding path program 1 times [2022-11-21 14:07:57,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:07:57,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978233015] [2022-11-21 14:07:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:07:57,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:07:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:57,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:07:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:57,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:07:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:57,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:07:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-21 14:07:57,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:07:57,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978233015] [2022-11-21 14:07:57,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978233015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:07:57,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:07:57,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 14:07:57,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258564388] [2022-11-21 14:07:57,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:07:57,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 14:07:57,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:07:57,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 14:07:57,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-21 14:07:57,994 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:07:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:07:58,234 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-11-21 14:07:58,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 14:07:58,234 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2022-11-21 14:07:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:07:58,235 INFO L225 Difference]: With dead ends: 119 [2022-11-21 14:07:58,235 INFO L226 Difference]: Without dead ends: 119 [2022-11-21 14:07:58,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-21 14:07:58,235 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 137 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 14:07:58,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 187 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 14:07:58,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-21 14:07:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2022-11-21 14:07:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 98 states have (on average 1.153061224489796) internal successors, (113), 106 states have internal predecessors, (113), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 14:07:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2022-11-21 14:07:58,252 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 68 [2022-11-21 14:07:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:07:58,252 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2022-11-21 14:07:58,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:07:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2022-11-21 14:07:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-21 14:07:58,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:07:58,254 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:07:58,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-21 14:07:58,254 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:07:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:07:58,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1757391830, now seen corresponding path program 1 times [2022-11-21 14:07:58,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:07:58,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213333838] [2022-11-21 14:07:58,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:07:58,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:07:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:58,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:07:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:58,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:07:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:58,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:07:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-21 14:07:58,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:07:58,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213333838] [2022-11-21 14:07:58,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213333838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:07:58,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:07:58,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 14:07:58,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994236552] [2022-11-21 14:07:58,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:07:58,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 14:07:58,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:07:58,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 14:07:58,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-21 14:07:58,525 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:07:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:07:58,713 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-21 14:07:58,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 14:07:58,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 69 [2022-11-21 14:07:58,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:07:58,715 INFO L225 Difference]: With dead ends: 116 [2022-11-21 14:07:58,715 INFO L226 Difference]: Without dead ends: 116 [2022-11-21 14:07:58,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-21 14:07:58,715 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 94 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:07:58,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 268 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:07:58,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-21 14:07:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2022-11-21 14:07:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 106 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 14:07:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2022-11-21 14:07:58,720 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 69 [2022-11-21 14:07:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:07:58,720 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2022-11-21 14:07:58,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:07:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2022-11-21 14:07:58,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-21 14:07:58,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:07:58,721 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:07:58,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-21 14:07:58,721 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:07:58,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:07:58,722 INFO L85 PathProgramCache]: Analyzing trace with hash -929953077, now seen corresponding path program 1 times [2022-11-21 14:07:58,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:07:58,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721110143] [2022-11-21 14:07:58,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:07:58,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:07:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:58,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:07:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:58,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:07:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:58,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:07:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:07:58,995 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-21 14:07:58,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:07:58,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721110143] [2022-11-21 14:07:58,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721110143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:07:58,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:07:58,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 14:07:58,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929187166] [2022-11-21 14:07:58,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:07:58,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 14:07:58,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:07:58,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 14:07:58,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-21 14:07:58,998 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:07:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:07:59,201 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-11-21 14:07:59,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 14:07:59,201 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2022-11-21 14:07:59,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:07:59,202 INFO L225 Difference]: With dead ends: 114 [2022-11-21 14:07:59,202 INFO L226 Difference]: Without dead ends: 114 [2022-11-21 14:07:59,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-21 14:07:59,203 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 83 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:07:59,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 238 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:07:59,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-21 14:07:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-21 14:07:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 107 states have internal predecessors, (113), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 14:07:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2022-11-21 14:07:59,211 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 71 [2022-11-21 14:07:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:07:59,211 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2022-11-21 14:07:59,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 14:07:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2022-11-21 14:07:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-21 14:07:59,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:07:59,213 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:07:59,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-21 14:07:59,213 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-21 14:07:59,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:07:59,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1692934892, now seen corresponding path program 1 times [2022-11-21 14:07:59,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:07:59,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539999304] [2022-11-21 14:07:59,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:07:59,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:07:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:08:00,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:08:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:08:00,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:08:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:08:00,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 14:08:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:08:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 14:08:00,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:08:00,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539999304] [2022-11-21 14:08:00,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539999304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:08:00,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100499305] [2022-11-21 14:08:00,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:08:00,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:08:00,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:08:00,728 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:08:00,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e070aa4-c418-4564-9162-d8970741142e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 14:08:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:08:01,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-21 14:08:01,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:08:01,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 14:08:01,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 14:08:02,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:08:02,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 114 [2022-11-21 14:08:05,804 INFO L350 Elim1Store]: Elim1 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 325 treesize of output 269 [2022-11-21 14:08:06,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:08:08,251 INFO L321 Elim1Store]: treesize reduction 72, result has 90.9 percent of original size [2022-11-21 14:08:08,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 22 new quantified variables, introduced 78 case distinctions, treesize of input 347 treesize of output 848