./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f --- 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-2329fc7 [2022-12-13 14:41:04,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:41:04,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:41:04,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:41:04,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:41:04,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:41:04,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:41:04,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:41:04,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:41:04,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:41:04,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:41:04,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:41:04,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:41:04,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:41:04,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:41:04,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:41:04,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:41:04,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:41:04,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:41:04,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:41:04,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:41:04,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:41:04,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:41:04,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:41:04,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:41:04,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:41:04,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:41:04,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:41:04,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:41:04,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:41:04,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:41:04,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:41:04,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:41:04,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:41:04,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:41:04,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:41:04,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:41:04,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:41:04,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:41:04,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:41:04,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:41:04,989 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-12-13 14:41:05,016 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:41:05,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:41:05,017 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:41:05,017 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:41:05,017 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:41:05,018 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:41:05,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:41:05,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:41:05,019 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:41:05,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:41:05,019 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:41:05,019 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 14:41:05,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:41:05,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:41:05,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:41:05,020 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 14:41:05,020 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 14:41:05,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:41:05,020 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 14:41:05,020 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:41:05,021 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:41:05,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:41:05,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:41:05,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:41:05,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:41:05,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:41:05,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:41:05,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:41:05,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 14:41:05,022 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:41:05,022 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:41:05,022 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:41:05,022 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:41:05,023 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/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_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8 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-memcleanup) ) 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 -> f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f [2022-12-13 14:41:05,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:41:05,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:41:05,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:41:05,224 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:41:05,225 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:41:05,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2022-12-13 14:41:07,714 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:41:07,950 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:41:07,951 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2022-12-13 14:41:07,966 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/data/8b9d143c4/9983be524cb141fc99adeffcf1f9306c/FLAGd1d45b6d8 [2022-12-13 14:41:08,294 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/data/8b9d143c4/9983be524cb141fc99adeffcf1f9306c [2022-12-13 14:41:08,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:41:08,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:41:08,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:41:08,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:41:08,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:41:08,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:41:08" (1/1) ... [2022-12-13 14:41:08,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a4162a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:41:08, skipping insertion in model container [2022-12-13 14:41:08,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:41:08" (1/1) ... [2022-12-13 14:41:08,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:41:08,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:41:08,528 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_6b51c572-e9cf-4e62-bf43-3647d52e07ad/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2022-12-13 14:41:08,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:41:08,557 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:41:08,578 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_6b51c572-e9cf-4e62-bf43-3647d52e07ad/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2022-12-13 14:41:08,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:41:08,604 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:41:08,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:41:08 WrapperNode [2022-12-13 14:41:08,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:41:08,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:41:08,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:41:08,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:41:08,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:41:08" (1/1) ... [2022-12-13 14:41:08,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:41:08" (1/1) ... [2022-12-13 14:41:08,653 INFO L138 Inliner]: procedures = 129, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2022-12-13 14:41:08,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:41:08,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:41:08,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:41:08,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:41:08,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:41:08" (1/1) ... [2022-12-13 14:41:08,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:41:08" (1/1) ... [2022-12-13 14:41:08,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:41:08" (1/1) ... [2022-12-13 14:41:08,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:41:08" (1/1) ... [2022-12-13 14:41:08,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:41:08" (1/1) ... [2022-12-13 14:41:08,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:41:08" (1/1) ... [2022-12-13 14:41:08,689 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:41:08" (1/1) ... [2022-12-13 14:41:08,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:41:08" (1/1) ... [2022-12-13 14:41:08,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:41:08,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:41:08,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:41:08,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:41:08,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:41:08" (1/1) ... [2022-12-13 14:41:08,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:41:08,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:41:08,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:41:08,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:41:08,756 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-12-13 14:41:08,757 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-12-13 14:41:08,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 14:41:08,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:41:08,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 14:41:08,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 14:41:08,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 14:41:08,757 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2022-12-13 14:41:08,757 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2022-12-13 14:41:08,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 14:41:08,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 14:41:08,758 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2022-12-13 14:41:08,758 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2022-12-13 14:41:08,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:41:08,758 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2022-12-13 14:41:08,758 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2022-12-13 14:41:08,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:41:08,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:41:08,874 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:41:08,876 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:41:09,302 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:41:09,308 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:41:09,308 INFO L300 CfgBuilder]: Removed 33 assume(true) statements. [2022-12-13 14:41:09,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:41:09 BoogieIcfgContainer [2022-12-13 14:41:09,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:41:09,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:41:09,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:41:09,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:41:09,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:41:08" (1/3) ... [2022-12-13 14:41:09,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ec8d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:41:09, skipping insertion in model container [2022-12-13 14:41:09,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:41:08" (2/3) ... [2022-12-13 14:41:09,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ec8d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:41:09, skipping insertion in model container [2022-12-13 14:41:09,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:41:09" (3/3) ... [2022-12-13 14:41:09,317 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2022-12-13 14:41:09,331 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:41:09,331 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2022-12-13 14:41:09,367 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:41:09,371 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=PETRI_NET, 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;@12324302, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:41:09,371 INFO L358 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2022-12-13 14:41:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 223 states, 120 states have (on average 2.1083333333333334) internal successors, (253), 210 states have internal predecessors, (253), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-12-13 14:41:09,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 14:41:09,380 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:09,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 14:41:09,381 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:09,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:09,385 INFO L85 PathProgramCache]: Analyzing trace with hash 6220774, now seen corresponding path program 1 times [2022-12-13 14:41:09,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:09,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618674291] [2022-12-13 14:41:09,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:09,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:09,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618674291] [2022-12-13 14:41:09,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618674291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:09,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:09,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:41:09,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227414524] [2022-12-13 14:41:09,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:09,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 14:41:09,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:09,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 14:41:09,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 14:41:09,535 INFO L87 Difference]: Start difference. First operand has 223 states, 120 states have (on average 2.1083333333333334) internal successors, (253), 210 states have internal predecessors, (253), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:09,558 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2022-12-13 14:41:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 14:41:09,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-13 14:41:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:09,566 INFO L225 Difference]: With dead ends: 221 [2022-12-13 14:41:09,566 INFO L226 Difference]: Without dead ends: 219 [2022-12-13 14:41:09,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 14:41:09,570 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:09,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:41:09,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-12-13 14:41:09,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-12-13 14:41:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 116 states have (on average 1.8448275862068966) internal successors, (214), 206 states have internal predecessors, (214), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 14:41:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 240 transitions. [2022-12-13 14:41:09,605 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 240 transitions. Word has length 4 [2022-12-13 14:41:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:09,606 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 240 transitions. [2022-12-13 14:41:09,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2022-12-13 14:41:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 14:41:09,606 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:09,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 14:41:09,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 14:41:09,607 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:09,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:09,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1692154958, now seen corresponding path program 1 times [2022-12-13 14:41:09,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:09,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402020498] [2022-12-13 14:41:09,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:09,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:09,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:09,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402020498] [2022-12-13 14:41:09,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402020498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:09,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:09,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:41:09,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470641666] [2022-12-13 14:41:09,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:09,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:41:09,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:09,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:41:09,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:41:09,715 INFO L87 Difference]: Start difference. First operand 219 states and 240 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12-13 14:41:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:09,851 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2022-12-13 14:41:09,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:41:09,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-12-13 14:41:09,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:09,853 INFO L225 Difference]: With dead ends: 217 [2022-12-13 14:41:09,853 INFO L226 Difference]: Without dead ends: 217 [2022-12-13 14:41:09,853 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-12-13 14:41:09,855 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 17 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:09,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 367 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:41:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-12-13 14:41:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-12-13 14:41:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 116 states have (on average 1.8275862068965518) internal successors, (212), 204 states have internal predecessors, (212), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 14:41:09,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2022-12-13 14:41:09,868 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 6 [2022-12-13 14:41:09,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:09,869 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2022-12-13 14:41:09,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12-13 14:41:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2022-12-13 14:41:09,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 14:41:09,869 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:09,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 14:41:09,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 14:41:09,870 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1692154959, now seen corresponding path program 1 times [2022-12-13 14:41:09,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:09,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480361090] [2022-12-13 14:41:09,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:09,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:09,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480361090] [2022-12-13 14:41:09,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480361090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:09,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:09,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:41:09,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982955297] [2022-12-13 14:41:09,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:09,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:41:09,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:09,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:41:09,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:41:09,976 INFO L87 Difference]: Start difference. First operand 217 states and 238 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12-13 14:41:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:10,081 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2022-12-13 14:41:10,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:41:10,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-12-13 14:41:10,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:10,083 INFO L225 Difference]: With dead ends: 215 [2022-12-13 14:41:10,083 INFO L226 Difference]: Without dead ends: 215 [2022-12-13 14:41:10,083 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-12-13 14:41:10,084 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 15 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:10,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 372 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:41:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-12-13 14:41:10,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-12-13 14:41:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 116 states have (on average 1.8103448275862069) internal successors, (210), 202 states have internal predecessors, (210), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 14:41:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 236 transitions. [2022-12-13 14:41:10,094 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 236 transitions. Word has length 6 [2022-12-13 14:41:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:10,094 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 236 transitions. [2022-12-13 14:41:10,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12-13 14:41:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 236 transitions. [2022-12-13 14:41:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 14:41:10,094 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:10,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:10,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 14:41:10,095 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting chain_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:10,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:10,096 INFO L85 PathProgramCache]: Analyzing trace with hash -387700622, now seen corresponding path program 1 times [2022-12-13 14:41:10,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:10,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295738334] [2022-12-13 14:41:10,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:10,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:10,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:10,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295738334] [2022-12-13 14:41:10,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295738334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:10,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:10,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:41:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19530437] [2022-12-13 14:41:10,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:10,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:41:10,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:10,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:41:10,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:41:10,231 INFO L87 Difference]: Start difference. First operand 215 states and 236 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-12-13 14:41:10,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:10,388 INFO L93 Difference]: Finished difference Result 210 states and 231 transitions. [2022-12-13 14:41:10,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:41:10,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 10 [2022-12-13 14:41:10,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:10,389 INFO L225 Difference]: With dead ends: 210 [2022-12-13 14:41:10,389 INFO L226 Difference]: Without dead ends: 210 [2022-12-13 14:41:10,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:41:10,390 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 56 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:10,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 606 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:41:10,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-12-13 14:41:10,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-12-13 14:41:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 116 states have (on average 1.7672413793103448) internal successors, (205), 197 states have internal predecessors, (205), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 14:41:10,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2022-12-13 14:41:10,401 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 10 [2022-12-13 14:41:10,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:10,402 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2022-12-13 14:41:10,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-12-13 14:41:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2022-12-13 14:41:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 14:41:10,402 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:10,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:10,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 14:41:10,403 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting chain_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:10,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash -387700621, now seen corresponding path program 1 times [2022-12-13 14:41:10,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:10,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791418020] [2022-12-13 14:41:10,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:10,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:10,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:10,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791418020] [2022-12-13 14:41:10,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791418020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:10,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:10,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:41:10,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613369108] [2022-12-13 14:41:10,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:10,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:41:10,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:10,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:41:10,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:41:10,579 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-12-13 14:41:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:10,800 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2022-12-13 14:41:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:41:10,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-12-13 14:41:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:10,802 INFO L225 Difference]: With dead ends: 205 [2022-12-13 14:41:10,802 INFO L226 Difference]: Without dead ends: 205 [2022-12-13 14:41:10,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:41:10,803 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 39 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:10,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 544 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:41:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-12-13 14:41:10,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-12-13 14:41:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 116 states have (on average 1.7241379310344827) internal successors, (200), 192 states have internal predecessors, (200), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 14:41:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 226 transitions. [2022-12-13 14:41:10,808 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 226 transitions. Word has length 10 [2022-12-13 14:41:10,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:10,808 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 226 transitions. [2022-12-13 14:41:10,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-12-13 14:41:10,809 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 226 transitions. [2022-12-13 14:41:10,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 14:41:10,809 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:10,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:10,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 14:41:10,809 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting chain_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:10,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:10,810 INFO L85 PathProgramCache]: Analyzing trace with hash 866182740, now seen corresponding path program 1 times [2022-12-13 14:41:10,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:10,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732452169] [2022-12-13 14:41:10,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:10,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:10,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:10,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732452169] [2022-12-13 14:41:10,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732452169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:10,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:10,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:41:10,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332851994] [2022-12-13 14:41:10,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:10,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:41:10,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:10,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:41:10,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:41:10,855 INFO L87 Difference]: Start difference. First operand 205 states and 226 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-12-13 14:41:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:11,002 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2022-12-13 14:41:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:41:11,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 11 [2022-12-13 14:41:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:11,003 INFO L225 Difference]: With dead ends: 204 [2022-12-13 14:41:11,003 INFO L226 Difference]: Without dead ends: 204 [2022-12-13 14:41:11,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:41:11,004 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 21 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:11,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 630 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:41:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-12-13 14:41:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2022-12-13 14:41:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 116 states have (on average 1.7155172413793103) internal successors, (199), 191 states have internal predecessors, (199), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 14:41:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 225 transitions. [2022-12-13 14:41:11,012 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 225 transitions. Word has length 11 [2022-12-13 14:41:11,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:11,012 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 225 transitions. [2022-12-13 14:41:11,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-12-13 14:41:11,013 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 225 transitions. [2022-12-13 14:41:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 14:41:11,013 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:11,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:11,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 14:41:11,014 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting chain_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:11,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:11,014 INFO L85 PathProgramCache]: Analyzing trace with hash 866182741, now seen corresponding path program 1 times [2022-12-13 14:41:11,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:11,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387093739] [2022-12-13 14:41:11,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:11,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:11,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:11,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387093739] [2022-12-13 14:41:11,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387093739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:11,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:11,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:41:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808640190] [2022-12-13 14:41:11,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:11,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:41:11,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:11,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:41:11,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:41:11,100 INFO L87 Difference]: Start difference. First operand 204 states and 225 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-12-13 14:41:11,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:11,264 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2022-12-13 14:41:11,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:41:11,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 11 [2022-12-13 14:41:11,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:11,265 INFO L225 Difference]: With dead ends: 203 [2022-12-13 14:41:11,265 INFO L226 Difference]: Without dead ends: 203 [2022-12-13 14:41:11,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:41:11,266 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 19 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:11,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 858 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:41:11,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-12-13 14:41:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-12-13 14:41:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 116 states have (on average 1.706896551724138) internal successors, (198), 190 states have internal predecessors, (198), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 14:41:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2022-12-13 14:41:11,272 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 11 [2022-12-13 14:41:11,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:11,273 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2022-12-13 14:41:11,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-12-13 14:41:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2022-12-13 14:41:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 14:41:11,273 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:11,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:11,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 14:41:11,274 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:11,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:11,274 INFO L85 PathProgramCache]: Analyzing trace with hash -610249734, now seen corresponding path program 1 times [2022-12-13 14:41:11,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:11,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105312868] [2022-12-13 14:41:11,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:11,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:11,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:41:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:11,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:11,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105312868] [2022-12-13 14:41:11,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105312868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:11,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:11,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:41:11,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106949862] [2022-12-13 14:41:11,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:11,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:41:11,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:11,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:41:11,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:41:11,539 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-12-13 14:41:11,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:11,938 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2022-12-13 14:41:11,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:41:11,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 19 [2022-12-13 14:41:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:11,939 INFO L225 Difference]: With dead ends: 202 [2022-12-13 14:41:11,939 INFO L226 Difference]: Without dead ends: 202 [2022-12-13 14:41:11,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:41:11,940 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 74 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:11,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 525 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:41:11,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-12-13 14:41:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-12-13 14:41:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 116 states have (on average 1.6982758620689655) internal successors, (197), 189 states have internal predecessors, (197), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 14:41:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 223 transitions. [2022-12-13 14:41:11,945 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 223 transitions. Word has length 19 [2022-12-13 14:41:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:11,946 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 223 transitions. [2022-12-13 14:41:11,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-12-13 14:41:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2022-12-13 14:41:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 14:41:11,946 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:11,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:11,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 14:41:11,947 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:11,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:11,947 INFO L85 PathProgramCache]: Analyzing trace with hash -610249733, now seen corresponding path program 1 times [2022-12-13 14:41:11,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:11,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636940741] [2022-12-13 14:41:11,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:11,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:12,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:41:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:12,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:12,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636940741] [2022-12-13 14:41:12,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636940741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:12,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:12,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:41:12,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755013683] [2022-12-13 14:41:12,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:12,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:41:12,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:12,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:41:12,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:41:12,244 INFO L87 Difference]: Start difference. First operand 202 states and 223 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-12-13 14:41:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:12,642 INFO L93 Difference]: Finished difference Result 218 states and 245 transitions. [2022-12-13 14:41:12,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:41:12,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 19 [2022-12-13 14:41:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:12,645 INFO L225 Difference]: With dead ends: 218 [2022-12-13 14:41:12,645 INFO L226 Difference]: Without dead ends: 218 [2022-12-13 14:41:12,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:41:12,646 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 67 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:12,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 484 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:41:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-12-13 14:41:12,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 207. [2022-12-13 14:41:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 120 states have (on average 1.6833333333333333) internal successors, (202), 193 states have internal predecessors, (202), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 14:41:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 230 transitions. [2022-12-13 14:41:12,655 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 230 transitions. Word has length 19 [2022-12-13 14:41:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:12,655 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 230 transitions. [2022-12-13 14:41:12,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-12-13 14:41:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 230 transitions. [2022-12-13 14:41:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 14:41:12,656 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:12,656 INFO L195 NwaCegarLoop]: trace histogram [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-12-13 14:41:12,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 14:41:12,656 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:12,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:12,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1097063055, now seen corresponding path program 1 times [2022-12-13 14:41:12,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:12,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560182234] [2022-12-13 14:41:12,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:12,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:12,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:41:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:12,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:12,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560182234] [2022-12-13 14:41:12,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560182234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:12,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:12,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:41:12,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987721770] [2022-12-13 14:41:12,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:12,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:41:12,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:12,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:41:12,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:41:12,883 INFO L87 Difference]: Start difference. First operand 207 states and 230 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-12-13 14:41:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:13,206 INFO L93 Difference]: Finished difference Result 206 states and 229 transitions. [2022-12-13 14:41:13,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:41:13,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 24 [2022-12-13 14:41:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:13,208 INFO L225 Difference]: With dead ends: 206 [2022-12-13 14:41:13,208 INFO L226 Difference]: Without dead ends: 206 [2022-12-13 14:41:13,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:41:13,209 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 124 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:13,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 472 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:41:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-12-13 14:41:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-12-13 14:41:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 120 states have (on average 1.675) internal successors, (201), 192 states have internal predecessors, (201), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 14:41:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 229 transitions. [2022-12-13 14:41:13,217 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 229 transitions. Word has length 24 [2022-12-13 14:41:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:13,217 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 229 transitions. [2022-12-13 14:41:13,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-12-13 14:41:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 229 transitions. [2022-12-13 14:41:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 14:41:13,218 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:13,218 INFO L195 NwaCegarLoop]: trace histogram [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-12-13 14:41:13,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 14:41:13,218 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:13,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:13,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1097063054, now seen corresponding path program 1 times [2022-12-13 14:41:13,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:13,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761186196] [2022-12-13 14:41:13,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:13,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:13,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:41:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:13,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:13,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761186196] [2022-12-13 14:41:13,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761186196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:13,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:13,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:41:13,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447793127] [2022-12-13 14:41:13,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:13,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:41:13,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:13,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:41:13,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:41:13,551 INFO L87 Difference]: Start difference. First operand 206 states and 229 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-12-13 14:41:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:13,882 INFO L93 Difference]: Finished difference Result 205 states and 228 transitions. [2022-12-13 14:41:13,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:41:13,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 24 [2022-12-13 14:41:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:13,883 INFO L225 Difference]: With dead ends: 205 [2022-12-13 14:41:13,883 INFO L226 Difference]: Without dead ends: 205 [2022-12-13 14:41:13,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:41:13,884 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 187 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:13,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 324 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:41:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-12-13 14:41:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-12-13 14:41:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 120 states have (on average 1.6666666666666667) internal successors, (200), 191 states have internal predecessors, (200), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 14:41:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 228 transitions. [2022-12-13 14:41:13,890 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 228 transitions. Word has length 24 [2022-12-13 14:41:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:13,890 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 228 transitions. [2022-12-13 14:41:13,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-12-13 14:41:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 228 transitions. [2022-12-13 14:41:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 14:41:13,891 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:13,892 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:13,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 14:41:13,892 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:13,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:13,892 INFO L85 PathProgramCache]: Analyzing trace with hash 450998278, now seen corresponding path program 1 times [2022-12-13 14:41:13,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:13,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522016397] [2022-12-13 14:41:13,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:13,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:14,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:41:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:14,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:41:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 14:41:14,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:14,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522016397] [2022-12-13 14:41:14,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522016397] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:41:14,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493528950] [2022-12-13 14:41:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:14,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:41:14,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:41:14,530 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:41:14,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 14:41:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:14,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 14:41:14,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:41:14,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:41:14,738 INFO L321 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-12-13 14:41:14,739 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 1 case distinctions, treesize of input 12 treesize of output 23 [2022-12-13 14:41:14,748 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 44 treesize of output 42 [2022-12-13 14:41:14,790 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-12-13 14:41:14,814 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_559 Int)) (= |c_#length| (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_559))) (< |chain_node_alloc_node_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 14:41:14,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:41:14,896 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-12-13 14:41:14,920 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-12-13 14:41:14,928 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_560 Int)) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_560) |c_#length|)) (< |chain_node_alloc_node_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 14:41:14,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:41:14,999 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-12-13 14:41:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 11 not checked. [2022-12-13 14:41:15,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:41:17,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493528950] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:41:17,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:41:17,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 15 [2022-12-13 14:41:17,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302569024] [2022-12-13 14:41:17,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 14:41:17,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 14:41:17,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:17,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 14:41:17,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=191, Unknown=2, NotChecked=58, Total=306 [2022-12-13 14:41:17,144 INFO L87 Difference]: Start difference. First operand 205 states and 228 transitions. Second operand has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 14:41:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:17,721 INFO L93 Difference]: Finished difference Result 204 states and 227 transitions. [2022-12-13 14:41:17,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:41:17,722 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-12-13 14:41:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:17,723 INFO L225 Difference]: With dead ends: 204 [2022-12-13 14:41:17,723 INFO L226 Difference]: Without dead ends: 204 [2022-12-13 14:41:17,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=71, Invalid=241, Unknown=2, NotChecked=66, Total=380 [2022-12-13 14:41:17,724 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 425 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 418 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:17,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 276 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 733 Invalid, 0 Unknown, 418 Unchecked, 0.5s Time] [2022-12-13 14:41:17,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-12-13 14:41:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2022-12-13 14:41:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 116 states have (on average 1.6724137931034482) internal successors, (194), 186 states have internal predecessors, (194), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 14:41:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2022-12-13 14:41:17,729 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 34 [2022-12-13 14:41:17,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:17,730 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2022-12-13 14:41:17,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 14:41:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2022-12-13 14:41:17,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 14:41:17,731 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:17,731 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:17,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 14:41:17,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:41:17,932 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:17,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:17,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1428439082, now seen corresponding path program 1 times [2022-12-13 14:41:17,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:17,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861995704] [2022-12-13 14:41:17,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:17,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:18,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:41:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:18,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:41:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:41:18,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:18,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861995704] [2022-12-13 14:41:18,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861995704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:18,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:18,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:41:18,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360110717] [2022-12-13 14:41:18,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:18,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:41:18,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:18,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:41:18,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:41:18,269 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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-12-13 14:41:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:18,659 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2022-12-13 14:41:18,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:41:18,660 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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 45 [2022-12-13 14:41:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:18,660 INFO L225 Difference]: With dead ends: 204 [2022-12-13 14:41:18,660 INFO L226 Difference]: Without dead ends: 204 [2022-12-13 14:41:18,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:41:18,661 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 195 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:18,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 430 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:41:18,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-12-13 14:41:18,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2022-12-13 14:41:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 116 states have (on average 1.6120689655172413) internal successors, (187), 179 states have internal predecessors, (187), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 14:41:18,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2022-12-13 14:41:18,665 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 45 [2022-12-13 14:41:18,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:18,666 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2022-12-13 14:41:18,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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-12-13 14:41:18,666 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2022-12-13 14:41:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 14:41:18,667 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:18,667 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:18,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 14:41:18,668 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:18,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1428439081, now seen corresponding path program 1 times [2022-12-13 14:41:18,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:18,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254311502] [2022-12-13 14:41:18,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:18,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:18,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:41:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:18,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:41:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:41:18,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:18,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254311502] [2022-12-13 14:41:18,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254311502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:18,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:18,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:41:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335108066] [2022-12-13 14:41:18,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:18,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:41:18,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:18,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:41:18,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:41:18,940 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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-12-13 14:41:19,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:19,322 INFO L93 Difference]: Finished difference Result 219 states and 249 transitions. [2022-12-13 14:41:19,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:41:19,322 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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 45 [2022-12-13 14:41:19,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:19,324 INFO L225 Difference]: With dead ends: 219 [2022-12-13 14:41:19,324 INFO L226 Difference]: Without dead ends: 219 [2022-12-13 14:41:19,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:41:19,325 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 362 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:19,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 187 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:41:19,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-12-13 14:41:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 194. [2022-12-13 14:41:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 123 states have (on average 1.5365853658536586) internal successors, (189), 180 states have internal predecessors, (189), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 14:41:19,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2022-12-13 14:41:19,331 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 45 [2022-12-13 14:41:19,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:19,331 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2022-12-13 14:41:19,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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-12-13 14:41:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2022-12-13 14:41:19,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 14:41:19,332 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:19,332 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:19,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 14:41:19,332 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:19,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:19,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1331938361, now seen corresponding path program 1 times [2022-12-13 14:41:19,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:19,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33004851] [2022-12-13 14:41:19,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:19,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:19,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:41:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:19,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:41:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:41:19,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:19,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33004851] [2022-12-13 14:41:19,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33004851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:19,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:19,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:41:19,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265243145] [2022-12-13 14:41:19,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:19,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:41:19,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:19,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:41:19,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:41:19,583 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 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-12-13 14:41:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:19,953 INFO L93 Difference]: Finished difference Result 199 states and 223 transitions. [2022-12-13 14:41:19,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:41:19,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 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 46 [2022-12-13 14:41:19,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:19,955 INFO L225 Difference]: With dead ends: 199 [2022-12-13 14:41:19,955 INFO L226 Difference]: Without dead ends: 199 [2022-12-13 14:41:19,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:41:19,956 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 176 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:19,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 400 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:41:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-12-13 14:41:19,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2022-12-13 14:41:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 123 states have (on average 1.4796747967479675) internal successors, (182), 173 states have internal predecessors, (182), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 14:41:19,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 210 transitions. [2022-12-13 14:41:19,960 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 210 transitions. Word has length 46 [2022-12-13 14:41:19,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:19,961 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 210 transitions. [2022-12-13 14:41:19,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 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-12-13 14:41:19,961 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 210 transitions. [2022-12-13 14:41:19,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 14:41:19,961 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:19,961 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:19,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 14:41:19,961 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:19,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:19,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1331938360, now seen corresponding path program 1 times [2022-12-13 14:41:19,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:19,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246515690] [2022-12-13 14:41:19,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:20,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:41:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:20,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:41:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:41:20,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:20,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246515690] [2022-12-13 14:41:20,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246515690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:20,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:20,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:41:20,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458654468] [2022-12-13 14:41:20,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:20,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:41:20,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:20,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:41:20,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:41:20,287 INFO L87 Difference]: Start difference. First operand 187 states and 210 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 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-12-13 14:41:20,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:20,655 INFO L93 Difference]: Finished difference Result 222 states and 257 transitions. [2022-12-13 14:41:20,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:41:20,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 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 46 [2022-12-13 14:41:20,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:20,658 INFO L225 Difference]: With dead ends: 222 [2022-12-13 14:41:20,658 INFO L226 Difference]: Without dead ends: 222 [2022-12-13 14:41:20,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:41:20,659 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 397 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:20,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 238 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:41:20,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-12-13 14:41:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 195. [2022-12-13 14:41:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 179 states have internal predecessors, (191), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 14:41:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 221 transitions. [2022-12-13 14:41:20,666 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 221 transitions. Word has length 46 [2022-12-13 14:41:20,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:20,666 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 221 transitions. [2022-12-13 14:41:20,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 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-12-13 14:41:20,667 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 221 transitions. [2022-12-13 14:41:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 14:41:20,667 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:20,667 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:20,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 14:41:20,668 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:20,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:20,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1810979602, now seen corresponding path program 1 times [2022-12-13 14:41:20,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:20,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927889734] [2022-12-13 14:41:20,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:20,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:21,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:41:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:21,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:41:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:21,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:41:21,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:21,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927889734] [2022-12-13 14:41:21,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927889734] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:41:21,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782743806] [2022-12-13 14:41:21,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:21,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:41:21,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:41:21,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:41:21,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 14:41:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:22,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-13 14:41:22,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:41:22,111 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-12-13 14:41:22,212 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 14:41:22,213 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 15 treesize of output 21 [2022-12-13 14:41:22,219 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 6 treesize of output 4 [2022-12-13 14:41:22,381 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:41:22,382 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 28 treesize of output 23 [2022-12-13 14:41:22,446 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:41:22,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-12-13 14:41:22,734 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1275 (Array Int Int))) (and (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1275) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1276) |c_#memory_$Pointer$.base|) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 14:41:22,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:41:22,773 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-12-13 14:41:22,773 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 3 case distinctions, treesize of input 33 treesize of output 49 [2022-12-13 14:41:22,782 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 24 treesize of output 20 [2022-12-13 14:41:22,859 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-12-13 14:41:22,949 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 28 treesize of output 20 [2022-12-13 14:41:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 14:41:23,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:41:23,117 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:41:23,117 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 19 treesize of output 15 [2022-12-13 14:41:23,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782743806] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:41:23,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:41:23,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 38 [2022-12-13 14:41:23,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935356982] [2022-12-13 14:41:23,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 14:41:23,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 14:41:23,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:23,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 14:41:23,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1439, Unknown=9, NotChecked=76, Total=1640 [2022-12-13 14:41:23,252 INFO L87 Difference]: Start difference. First operand 195 states and 221 transitions. Second operand has 38 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 14:41:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:26,604 INFO L93 Difference]: Finished difference Result 287 states and 327 transitions. [2022-12-13 14:41:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 14:41:26,604 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 51 [2022-12-13 14:41:26,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:26,606 INFO L225 Difference]: With dead ends: 287 [2022-12-13 14:41:26,606 INFO L226 Difference]: Without dead ends: 287 [2022-12-13 14:41:26,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=362, Invalid=3409, Unknown=15, NotChecked=120, Total=3906 [2022-12-13 14:41:26,607 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 559 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 3396 mSolverCounterSat, 107 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 3803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3396 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:26,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1880 Invalid, 3803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 3396 Invalid, 9 Unknown, 291 Unchecked, 2.0s Time] [2022-12-13 14:41:26,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-12-13 14:41:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 209. [2022-12-13 14:41:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 149 states have (on average 1.4161073825503356) internal successors, (211), 192 states have internal predecessors, (211), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 14:41:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 241 transitions. [2022-12-13 14:41:26,613 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 241 transitions. Word has length 51 [2022-12-13 14:41:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:26,613 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 241 transitions. [2022-12-13 14:41:26,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 14:41:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 241 transitions. [2022-12-13 14:41:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 14:41:26,614 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:26,614 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:26,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 14:41:26,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 14:41:26,815 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:26,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:26,815 INFO L85 PathProgramCache]: Analyzing trace with hash 878718428, now seen corresponding path program 1 times [2022-12-13 14:41:26,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:26,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226337123] [2022-12-13 14:41:26,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:26,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:27,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:41:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:27,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:41:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:41:27,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:27,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226337123] [2022-12-13 14:41:27,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226337123] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:41:27,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384118307] [2022-12-13 14:41:27,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:27,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:41:27,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:41:27,782 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:41:27,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 14:41:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:27,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-13 14:41:27,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:41:27,992 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-12-13 14:41:28,116 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:41:28,116 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 24 treesize of output 19 [2022-12-13 14:41:28,248 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-13 14:41:28,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 29 [2022-12-13 14:41:28,327 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-13 14:41:28,327 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 11 [2022-12-13 14:41:28,648 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1496 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_1494) |chain_node_~node~0#1.base| v_ArrVal_1496) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1497)) (<= |chain_node_~node~0#1.base| |chain_node_alloc_node_~ptr~0#1.base|) (< |chain_node_alloc_node_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 14:41:28,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:41:28,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:41:28,735 INFO L321 Elim1Store]: treesize reduction 90, result has 40.8 percent of original size [2022-12-13 14:41:28,736 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 7 case distinctions, treesize of input 43 treesize of output 87 [2022-12-13 14:41:28,794 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-13 14:41:28,800 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 14:41:28,831 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 6 treesize of output 4 [2022-12-13 14:41:28,834 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 9 treesize of output 7 [2022-12-13 14:41:28,838 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2022-12-13 14:41:28,896 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-12-13 14:41:28,964 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 16 treesize of output 8 [2022-12-13 14:41:28,970 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 14:41:28,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:41:29,023 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 10 treesize of output 8 [2022-12-13 14:41:29,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384118307] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:41:29,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:41:29,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 37 [2022-12-13 14:41:29,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876256075] [2022-12-13 14:41:29,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 14:41:29,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-13 14:41:29,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:41:29,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-13 14:41:29,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1267, Unknown=24, NotChecked=72, Total=1482 [2022-12-13 14:41:29,173 INFO L87 Difference]: Start difference. First operand 209 states and 241 transitions. Second operand has 37 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 14:41:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:41:32,716 INFO L93 Difference]: Finished difference Result 298 states and 337 transitions. [2022-12-13 14:41:32,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 14:41:32,716 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 53 [2022-12-13 14:41:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:41:32,718 INFO L225 Difference]: With dead ends: 298 [2022-12-13 14:41:32,718 INFO L226 Difference]: Without dead ends: 298 [2022-12-13 14:41:32,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=372, Invalid=3257, Unknown=35, NotChecked=118, Total=3782 [2022-12-13 14:41:32,719 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 647 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 3595 mSolverCounterSat, 95 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 3946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3595 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:41:32,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 2026 Invalid, 3946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3595 Invalid, 10 Unknown, 246 Unchecked, 2.3s Time] [2022-12-13 14:41:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-12-13 14:41:32,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 209. [2022-12-13 14:41:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 192 states have internal predecessors, (210), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 14:41:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 240 transitions. [2022-12-13 14:41:32,724 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 240 transitions. Word has length 53 [2022-12-13 14:41:32,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:41:32,724 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 240 transitions. [2022-12-13 14:41:32,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 14:41:32,724 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 240 transitions. [2022-12-13 14:41:32,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 14:41:32,724 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:41:32,724 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:32,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 14:41:32,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 14:41:32,926 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:41:32,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:32,927 INFO L85 PathProgramCache]: Analyzing trace with hash 878707492, now seen corresponding path program 1 times [2022-12-13 14:41:32,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:41:32,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528201230] [2022-12-13 14:41:32,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:32,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:41:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:33,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:41:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:33,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:41:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:41:34,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:41:34,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528201230] [2022-12-13 14:41:34,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528201230] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:41:34,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057779764] [2022-12-13 14:41:34,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:34,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:41:34,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:41:34,368 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:41:34,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 14:41:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:34,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-13 14:41:34,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:41:34,529 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-13 14:41:34,529 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-13 14:41:34,682 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-12-13 14:41:34,699 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 14:41:34,700 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-12-13 14:41:34,791 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 14:41:34,791 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 24 treesize of output 28 [2022-12-13 14:41:34,802 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 14 treesize of output 10 [2022-12-13 14:41:35,040 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:41:35,041 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 48 treesize of output 39 [2022-12-13 14:41:35,131 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:41:35,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2022-12-13 14:41:35,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:41:35,582 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-12-13 14:41:35,582 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 3 case distinctions, treesize of input 53 treesize of output 67 [2022-12-13 14:41:35,610 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2022-12-13 14:41:35,610 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 3 case distinctions, treesize of input 35 treesize of output 60 [2022-12-13 14:41:35,697 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 67 treesize of output 57 [2022-12-13 14:41:35,752 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 14 treesize of output 10 [2022-12-13 14:41:36,263 INFO L321 Elim1Store]: treesize reduction 58, result has 72.1 percent of original size [2022-12-13 14:41:36,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 73 treesize of output 207 [2022-12-13 14:54:14,489 WARN L233 SmtUtils]: Spent 10.40m on a formula simplification. DAG size of input: 4461 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:54:14,639 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 133 treesize of output 113 [2022-12-13 14:54:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:54:23,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:54:24,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057779764] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:54:24,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:54:24,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 44 [2022-12-13 14:54:24,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590653498] [2022-12-13 14:54:24,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 14:54:24,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-13 14:54:24,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:54:24,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 14:54:24,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2205, Unknown=10, NotChecked=0, Total=2352 [2022-12-13 14:54:24,339 INFO L87 Difference]: Start difference. First operand 209 states and 240 transitions. Second operand has 45 states, 40 states have (on average 2.275) internal successors, (91), 40 states have internal predecessors, (91), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 14:54:41,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 14:54:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:54:42,322 INFO L93 Difference]: Finished difference Result 286 states and 326 transitions. [2022-12-13 14:54:42,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 14:54:42,322 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 2.275) internal successors, (91), 40 states have internal predecessors, (91), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 53 [2022-12-13 14:54:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:54:42,323 INFO L225 Difference]: With dead ends: 286 [2022-12-13 14:54:42,323 INFO L226 Difference]: Without dead ends: 286 [2022-12-13 14:54:42,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 663.2s TimeCoverageRelationStatistics Valid=381, Invalid=4284, Unknown=27, NotChecked=0, Total=4692 [2022-12-13 14:54:42,324 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 269 mSDsluCounter, 2364 mSDsCounter, 0 mSdLazyCounter, 4839 mSolverCounterSat, 68 mSolverCounterUnsat, 130 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 5037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 4839 IncrementalHoareTripleChecker+Invalid, 130 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-12-13 14:54:42,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 2463 Invalid, 5037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 4839 Invalid, 130 Unknown, 0 Unchecked, 8.8s Time] [2022-12-13 14:54:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-12-13 14:54:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 209. [2022-12-13 14:54:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 149 states have (on average 1.4026845637583893) internal successors, (209), 192 states have internal predecessors, (209), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 14:54:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 239 transitions. [2022-12-13 14:54:42,328 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 239 transitions. Word has length 53 [2022-12-13 14:54:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:54:42,328 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 239 transitions. [2022-12-13 14:54:42,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 2.275) internal successors, (91), 40 states have internal predecessors, (91), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 14:54:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 239 transitions. [2022-12-13 14:54:42,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 14:54:42,328 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:54:42,328 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:54:42,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 14:54:42,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:54:42,529 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:54:42,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:54:42,529 INFO L85 PathProgramCache]: Analyzing trace with hash 878707493, now seen corresponding path program 1 times [2022-12-13 14:54:42,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:54:42,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548813478] [2022-12-13 14:54:42,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:54:42,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:54:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:54:43,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:54:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:54:43,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:54:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:54:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:54:45,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:54:45,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548813478] [2022-12-13 14:54:45,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548813478] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:54:45,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365043625] [2022-12-13 14:54:45,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:54:45,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:54:45,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:54:45,318 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:54:45,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 14:54:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:54:45,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 119 conjunts are in the unsatisfiable core [2022-12-13 14:54:45,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:54:45,519 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-12-13 14:54:45,754 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-12-13 14:54:45,759 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-12-13 14:54:46,020 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:54:46,021 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 23 treesize of output 18 [2022-12-13 14:54:46,033 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:54:46,033 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 34 treesize of output 25 [2022-12-13 14:54:46,269 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:54:46,269 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 34 treesize of output 25 [2022-12-13 14:54:46,287 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:54:46,287 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 23 treesize of output 18 [2022-12-13 14:54:46,378 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:54:46,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2022-12-13 14:54:46,383 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:54:46,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 14:54:47,062 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1949 Int) (v_ArrVal_1954 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_1957 (Array Int Int))) (and (= (store |c_old(#length)| |chain_node_~node~0#1.base| v_ArrVal_1949) |c_#length|) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_1955) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1957)) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1954) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1956) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-12-13 14:54:47,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:54:47,131 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-12-13 14:54:47,131 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 3 case distinctions, treesize of input 39 treesize of output 53 [2022-12-13 14:54:47,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:54:47,176 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-12-13 14:54:47,176 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 3 case distinctions, treesize of input 28 treesize of output 44 [2022-12-13 14:54:47,185 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 13 treesize of output 9 [2022-12-13 14:54:47,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:54:47,200 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 14 treesize of output 16 [2022-12-13 14:54:47,212 INFO L321 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-12-13 14:54:47,212 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 13 [2022-12-13 14:54:47,222 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 21 treesize of output 15 [2022-12-13 14:54:47,243 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 7 treesize of output 5 [2022-12-13 14:54:47,367 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-12-13 14:54:47,532 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 17 treesize of output 9 [2022-12-13 14:54:47,535 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-12-13 14:54:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 14:54:47,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:54:47,805 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 10 treesize of output 8 [2022-12-13 14:54:48,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365043625] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:54:48,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:54:48,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2022-12-13 14:54:48,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865092839] [2022-12-13 14:54:48,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 14:54:48,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-13 14:54:48,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:54:48,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 14:54:48,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2294, Unknown=4, NotChecked=96, Total=2550 [2022-12-13 14:54:48,215 INFO L87 Difference]: Start difference. First operand 209 states and 239 transitions. Second operand has 45 states, 42 states have (on average 2.119047619047619) internal successors, (89), 42 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 14:54:54,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:54:54,018 INFO L93 Difference]: Finished difference Result 316 states and 361 transitions. [2022-12-13 14:54:54,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 14:54:54,018 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.119047619047619) internal successors, (89), 42 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 53 [2022-12-13 14:54:54,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:54:54,019 INFO L225 Difference]: With dead ends: 316 [2022-12-13 14:54:54,019 INFO L226 Difference]: Without dead ends: 316 [2022-12-13 14:54:54,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=385, Invalid=4301, Unknown=10, NotChecked=134, Total=4830 [2022-12-13 14:54:54,020 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 583 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 3904 mSolverCounterSat, 121 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 4254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 3904 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-12-13 14:54:54,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1605 Invalid, 4254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 3904 Invalid, 8 Unknown, 221 Unchecked, 3.7s Time] [2022-12-13 14:54:54,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-12-13 14:54:54,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 225. [2022-12-13 14:54:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 163 states have (on average 1.3987730061349692) internal successors, (228), 207 states have internal predecessors, (228), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-13 14:54:54,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 260 transitions. [2022-12-13 14:54:54,024 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 260 transitions. Word has length 53 [2022-12-13 14:54:54,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:54:54,024 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 260 transitions. [2022-12-13 14:54:54,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.119047619047619) internal successors, (89), 42 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 14:54:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 260 transitions. [2022-12-13 14:54:54,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 14:54:54,025 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:54:54,025 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:54:54,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 14:54:54,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:54:54,227 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-12-13 14:54:54,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:54:54,228 INFO L85 PathProgramCache]: Analyzing trace with hash -466747990, now seen corresponding path program 1 times [2022-12-13 14:54:54,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:54:54,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622787664] [2022-12-13 14:54:54,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:54:54,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:54:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:54:54,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:54:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:54:54,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:54:54,334 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 14:54:54,335 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (82 of 83 remaining) [2022-12-13 14:54:54,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 83 remaining) [2022-12-13 14:54:54,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 83 remaining) [2022-12-13 14:54:54,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_nextErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 83 remaining) [2022-12-13 14:54:54,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_nextErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 83 remaining) [2022-12-13 14:54:54,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_prevErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 83 remaining) [2022-12-13 14:54:54,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_prevErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 83 remaining) [2022-12-13 14:54:54,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_prevErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 83 remaining) [2022-12-13 14:54:54,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_prevErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 83 remaining) [2022-12-13 14:54:54,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 83 remaining) [2022-12-13 14:54:54,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 83 remaining) [2022-12-13 14:54:54,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 83 remaining) [2022-12-13 14:54:54,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 83 remaining) [2022-12-13 14:54:54,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 83 remaining) [2022-12-13 14:54:54,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 83 remaining) [2022-12-13 14:54:54,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 83 remaining) [2022-12-13 14:54:54,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 83 remaining) [2022-12-13 14:54:54,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 83 remaining) [2022-12-13 14:54:54,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 83 remaining) [2022-12-13 14:54:54,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 83 remaining) [2022-12-13 14:54:54,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 83 remaining) [2022-12-13 14:54:54,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 83 remaining) [2022-12-13 14:54:54,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 83 remaining) [2022-12-13 14:54:54,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 83 remaining) [2022-12-13 14:54:54,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 83 remaining) [2022-12-13 14:54:54,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 83 remaining) [2022-12-13 14:54:54,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 83 remaining) [2022-12-13 14:54:54,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 83 remaining) [2022-12-13 14:54:54,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 83 remaining) [2022-12-13 14:54:54,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 83 remaining) [2022-12-13 14:54:54,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 83 remaining) [2022-12-13 14:54:54,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 83 remaining) [2022-12-13 14:54:54,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 83 remaining) [2022-12-13 14:54:54,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 83 remaining) [2022-12-13 14:54:54,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 83 remaining) [2022-12-13 14:54:54,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 83 remaining) [2022-12-13 14:54:54,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE (3 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (2 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (1 of 83 remaining) [2022-12-13 14:54:54,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK (0 of 83 remaining) [2022-12-13 14:54:54,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 14:54:54,344 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:54:54,347 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 14:54:54,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:54:54 BoogieIcfgContainer [2022-12-13 14:54:54,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 14:54:54,370 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 14:54:54,370 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 14:54:54,371 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 14:54:54,371 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:41:09" (3/4) ... [2022-12-13 14:54:54,372 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 14:54:54,409 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 14:54:54,409 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 14:54:54,410 INFO L158 Benchmark]: Toolchain (without parser) took 826112.26ms. Allocated memory was 138.4MB in the beginning and 469.8MB in the end (delta: 331.4MB). Free memory was 101.5MB in the beginning and 366.4MB in the end (delta: -265.0MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2022-12-13 14:54:54,410 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:54:54,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.22ms. Allocated memory is still 138.4MB. Free memory was 101.0MB in the beginning and 83.3MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 14:54:54,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.83ms. Allocated memory is still 138.4MB. Free memory was 83.3MB in the beginning and 80.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:54:54,410 INFO L158 Benchmark]: Boogie Preprocessor took 42.52ms. Allocated memory is still 138.4MB. Free memory was 80.9MB in the beginning and 78.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 14:54:54,410 INFO L158 Benchmark]: RCFGBuilder took 613.07ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 78.4MB in the beginning and 142.4MB in the end (delta: -64.0MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2022-12-13 14:54:54,410 INFO L158 Benchmark]: TraceAbstraction took 825058.33ms. Allocated memory was 174.1MB in the beginning and 469.8MB in the end (delta: 295.7MB). Free memory was 141.4MB in the beginning and 370.6MB in the end (delta: -229.2MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2022-12-13 14:54:54,410 INFO L158 Benchmark]: Witness Printer took 38.79ms. Allocated memory is still 469.8MB. Free memory was 370.6MB in the beginning and 366.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 14:54:54,411 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.22ms. Allocated memory is still 138.4MB. Free memory was 101.0MB in the beginning and 83.3MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.83ms. Allocated memory is still 138.4MB. Free memory was 83.3MB in the beginning and 80.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.52ms. Allocated memory is still 138.4MB. Free memory was 80.9MB in the beginning and 78.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 613.07ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 78.4MB in the beginning and 142.4MB in the end (delta: -64.0MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * TraceAbstraction took 825058.33ms. Allocated memory was 174.1MB in the beginning and 469.8MB in the end (delta: 295.7MB). Free memory was 141.4MB in the beginning and 370.6MB in the end (delta: -229.2MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. * Witness Printer took 38.79ms. Allocated memory is still 469.8MB. Free memory was 370.6MB in the beginning and 366.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L639] const struct node *p1, *p2; [L640] CALL, EXPR create_sll(&p1, &p2) [L588] struct node *list = ((void *)0); VAL [list={6:0}, pp1={5:0}, pp1={5:0}, pp2={7:0}, pp2={7:0}] [L590] CALL chain_node(&list) [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) VAL [ptr={3:0}] [L576] ptr->next = ((void *)0) VAL [ptr={3:0}] [L577] ptr->prev = ((void *)0) VAL [ptr={3:0}] [L578] return ptr; VAL [\result={3:0}, ptr={3:0}] [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) VAL [\read(**ppnode)={0:0}, node={3:0}, ppnode={6:0}, ppnode={6:0}] [L583] node->next = *ppnode VAL [\read(**ppnode)={0:0}, node={3:0}, ppnode={6:0}, ppnode={6:0}] [L584] *ppnode = node VAL [node={3:0}, ppnode={6:0}, ppnode={6:0}] [L590] RET chain_node(&list) VAL [list={6:0}, pp1={5:0}, pp1={5:0}, pp2={7:0}, pp2={7:0}] [L591] COND FALSE !(__VERIFIER_nondet_int()) [L592] EXPR \read(*list) VAL [\read(*list)={3:0}, list={6:0}, pp1={5:0}, pp1={5:0}, pp2={7:0}, pp2={7:0}] [L592] *pp2 = list VAL [\read(*list)={3:0}, list={6:0}, pp1={5:0}, pp1={5:0}, pp2={7:0}, pp2={7:0}] [L593] COND FALSE !(__VERIFIER_nondet_int()) [L595] EXPR \read(*list) VAL [\read(*list)={3:0}, list={6:0}, pp1={5:0}, pp1={5:0}, pp2={7:0}, pp2={7:0}] [L595] *pp1 = list VAL [\read(*list)={3:0}, list={6:0}, pp1={5:0}, pp1={5:0}, pp2={7:0}, pp2={7:0}] [L597] CALL chain_node(&list) [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) VAL [ptr={-1:0}] [L576] ptr->next = ((void *)0) VAL [ptr={-1:0}] [L577] ptr->prev = ((void *)0) VAL [ptr={-1:0}] [L578] return ptr; VAL [\result={-1:0}, ptr={-1:0}] [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) VAL [\read(**ppnode)={3:0}, node={-1:0}, ppnode={6:0}, ppnode={6:0}] [L583] node->next = *ppnode VAL [\read(**ppnode)={3:0}, node={-1:0}, ppnode={6:0}, ppnode={6:0}] [L584] *ppnode = node VAL [node={-1:0}, ppnode={6:0}, ppnode={6:0}] [L597] RET chain_node(&list) VAL [list={6:0}, pp1={5:0}, pp1={5:0}, pp2={7:0}, pp2={7:0}] [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR \read(*list) VAL [\read(*list)={-1:0}, list={6:0}, pp1={5:0}, pp1={5:0}, pp2={7:0}, pp2={7:0}] [L599] return list; [L588] struct node *list = ((void *)0); [L599] return list; VAL [\result={-1:0}, pp1={5:0}, pp1={5:0}, pp2={7:0}, pp2={7:0}] [L640] RET, EXPR create_sll(&p1, &p2) [L640] struct node *list = create_sll(&p1, &p2); [L642] EXPR \read(*p1) VAL [\read(*p1)={3:0}, list={-1:0}, p1={5:0}, p2={7:0}] [L642] EXPR \read(*p2) VAL [\read(*p1)={3:0}, \read(*p2)={3:0}, list={-1:0}, p1={5:0}, p2={7:0}] [L642] CALL check_seq_next(p1, p2) VAL [beg={3:0}, end={3:0}] [L626] COND FALSE !(!(beg)) VAL [beg={3:0}, beg={3:0}, end={3:0}, end={3:0}] [L627] COND FALSE !(!(end)) VAL [beg={3:0}, beg={3:0}, end={3:0}, end={3:0}] [L628] EXPR beg->next VAL [beg={3:0}, beg={3:0}, beg->next={0:0}, end={3:0}, end={3:0}] [L628] beg = beg->next [L628] COND TRUE end != beg VAL [beg={0:0}, beg={3:0}, end={3:0}, end={3:0}] [L629] COND TRUE !(beg) VAL [beg={3:0}, beg={0:0}, end={3:0}, end={3:0}] [L629] CALL fail() [L565] reach_error() - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 637]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 83 error locations. Started 1 CEGAR loops. OverallTime: 825.0s, OverallIterations: 21, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 35.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 157 mSolverCounterUnknown, 4269 SdHoareTripleChecker+Valid, 20.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4232 mSDsluCounter, 14929 SdHoareTripleChecker+Invalid, 18.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1176 IncrementalHoareTripleChecker+Unchecked, 12037 mSDsCounter, 701 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22162 IncrementalHoareTripleChecker+Invalid, 24196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 701 mSolverCounterUnsat, 2892 mSDtfsCounter, 22162 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 618 GetRequests, 261 SyntacticMatches, 10 SemanticMatches, 347 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3365 ImplicationChecksByTransitivity, 675.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=20, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 427 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 787.1s InterpolantComputationTime, 872 NumberOfCodeBlocks, 872 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 789 ConstructedInterpolants, 101 QuantifiedInterpolants, 24382 SizeOfPredicates, 115 NumberOfNonLiveVariables, 2048 ConjunctsInSsa, 371 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 60/174 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 14:54:54,618 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-13 14:54:54,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b51c572-e9cf-4e62-bf43-3647d52e07ad/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)