./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R --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 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf --- 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-38b53e6 [2022-11-25 17:15:13,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:15:13,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:15:13,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:15:13,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:15:13,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:15:13,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:15:13,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:15:13,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:15:13,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:15:13,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:15:13,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:15:13,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:15:13,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:15:13,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:15:13,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:15:13,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:15:13,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:15:13,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:15:13,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:15:13,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:15:13,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:15:13,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:15:13,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:15:13,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:15:13,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:15:13,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:15:13,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:15:13,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:15:13,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:15:13,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:15:13,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:15:13,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:15:13,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:15:13,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:15:13,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:15:13,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:15:13,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:15:13,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:15:13,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:15:13,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:15:13,163 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-11-25 17:15:13,194 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:15:13,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:15:13,195 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:15:13,195 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:15:13,196 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:15:13,196 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:15:13,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:15:13,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:15:13,197 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:15:13,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:15:13,198 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:15:13,198 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:15:13,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:15:13,199 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:15:13,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:15:13,199 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:15:13,199 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:15:13,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:15:13,200 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:15:13,200 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:15:13,200 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:15:13,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:15:13,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:15:13,201 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:15:13,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:15:13,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:15:13,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:15:13,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:15:13,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:15:13,203 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:15:13,203 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:15:13,203 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:15:13,203 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_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R/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_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R 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 -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2022-11-25 17:15:13,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:15:13,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:15:13,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:15:13,557 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:15:13,557 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:15:13,559 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2022-11-25 17:15:16,712 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:15:17,000 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:15:17,000 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2022-11-25 17:15:17,014 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R/data/f0c230fa6/3a134498963e4a05ab967fe28f235a25/FLAGbb6dfb77a [2022-11-25 17:15:17,033 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R/data/f0c230fa6/3a134498963e4a05ab967fe28f235a25 [2022-11-25 17:15:17,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:15:17,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:15:17,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:15:17,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:15:17,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:15:17,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:15:17" (1/1) ... [2022-11-25 17:15:17,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26f582b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:15:17, skipping insertion in model container [2022-11-25 17:15:17,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:15:17" (1/1) ... [2022-11-25 17:15:17,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:15:17,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:15:17,503 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_28eeb59e-3958-4fe9-b395-8c2bce6c6801/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2022-11-25 17:15:17,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:15:17,584 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:15:17,628 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_28eeb59e-3958-4fe9-b395-8c2bce6c6801/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2022-11-25 17:15:17,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:15:17,694 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:15:17,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:15:17 WrapperNode [2022-11-25 17:15:17,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:15:17,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:15:17,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:15:17,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:15:17,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:15:17" (1/1) ... [2022-11-25 17:15:17,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:15:17" (1/1) ... [2022-11-25 17:15:17,752 INFO L138 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 294 [2022-11-25 17:15:17,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:15:17,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:15:17,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:15:17,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:15:17,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:15:17" (1/1) ... [2022-11-25 17:15:17,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:15:17" (1/1) ... [2022-11-25 17:15:17,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:15:17" (1/1) ... [2022-11-25 17:15:17,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:15:17" (1/1) ... [2022-11-25 17:15:17,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:15:17" (1/1) ... [2022-11-25 17:15:17,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:15:17" (1/1) ... [2022-11-25 17:15:17,830 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:15:17" (1/1) ... [2022-11-25 17:15:17,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:15:17" (1/1) ... [2022-11-25 17:15:17,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:15:17,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:15:17,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:15:17,844 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:15:17,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:15:17" (1/1) ... [2022-11-25 17:15:17,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:15:17,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:17,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:15:17,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:15:17,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:15:17,923 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2022-11-25 17:15:17,923 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2022-11-25 17:15:17,923 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-11-25 17:15:17,923 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-11-25 17:15:17,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:15:17,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:15:17,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:15:17,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:15:17,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 17:15:17,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 17:15:17,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:15:17,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:15:17,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:15:17,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:15:18,057 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:15:18,059 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:15:18,969 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:15:18,976 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:15:18,977 INFO L300 CfgBuilder]: Removed 33 assume(true) statements. [2022-11-25 17:15:18,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:15:18 BoogieIcfgContainer [2022-11-25 17:15:18,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:15:18,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:15:18,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:15:18,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:15:18,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:15:17" (1/3) ... [2022-11-25 17:15:19,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3741fc2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:15:19, skipping insertion in model container [2022-11-25 17:15:19,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:15:17" (2/3) ... [2022-11-25 17:15:19,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3741fc2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:15:19, skipping insertion in model container [2022-11-25 17:15:19,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:15:18" (3/3) ... [2022-11-25 17:15:19,002 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2022-11-25 17:15:19,021 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:15:19,021 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2022-11-25 17:15:19,073 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:15:19,079 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;@59f74de9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:15:19,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2022-11-25 17:15:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 262 states, 139 states have (on average 2.194244604316547) internal successors, (305), 259 states have internal predecessors, (305), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 17:15:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 17:15:19,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:19,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:15:19,094 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:19,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash 56404890, now seen corresponding path program 1 times [2022-11-25 17:15:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:19,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64073106] [2022-11-25 17:15:19,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:19,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:19,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:19,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64073106] [2022-11-25 17:15:19,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64073106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:19,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:19,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:15:19,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324677276] [2022-11-25 17:15:19,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:19,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:15:19,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:19,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:15:19,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:15:19,299 INFO L87 Difference]: Start difference. First operand has 262 states, 139 states have (on average 2.194244604316547) internal successors, (305), 259 states have internal predecessors, (305), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:19,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:19,345 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2022-11-25 17:15:19,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:15:19,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 17:15:19,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:19,358 INFO L225 Difference]: With dead ends: 260 [2022-11-25 17:15:19,358 INFO L226 Difference]: Without dead ends: 258 [2022-11-25 17:15:19,360 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-11-25 17:15:19,363 INFO L413 NwaCegarLoop]: 285 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, 285 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-11-25 17:15:19,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:15:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-25 17:15:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-11-25 17:15:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 137 states have (on average 1.9416058394160585) internal successors, (266), 255 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 283 transitions. [2022-11-25 17:15:19,416 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 283 transitions. Word has length 5 [2022-11-25 17:15:19,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:19,416 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 283 transitions. [2022-11-25 17:15:19,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:19,417 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 283 transitions. [2022-11-25 17:15:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 17:15:19,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:19,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 17:15:19,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:15:19,418 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:19,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:19,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1747491005, now seen corresponding path program 1 times [2022-11-25 17:15:19,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:19,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778324082] [2022-11-25 17:15:19,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:19,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:19,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:19,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778324082] [2022-11-25 17:15:19,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778324082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:19,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:19,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:15:19,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063857536] [2022-11-25 17:15:19,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:19,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:19,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:19,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:19,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:15:19,484 INFO L87 Difference]: Start difference. First operand 258 states and 283 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-11-25 17:15:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:19,879 INFO L93 Difference]: Finished difference Result 391 states and 435 transitions. [2022-11-25 17:15:19,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:19,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-25 17:15:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:19,887 INFO L225 Difference]: With dead ends: 391 [2022-11-25 17:15:19,887 INFO L226 Difference]: Without dead ends: 390 [2022-11-25 17:15:19,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:15:19,895 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 133 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:19,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 396 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:15:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-25 17:15:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 261. [2022-11-25 17:15:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 140 states have (on average 1.9285714285714286) internal successors, (270), 258 states have internal predecessors, (270), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 287 transitions. [2022-11-25 17:15:19,933 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 287 transitions. Word has length 6 [2022-11-25 17:15:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:19,934 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 287 transitions. [2022-11-25 17:15:19,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-11-25 17:15:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 287 transitions. [2022-11-25 17:15:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 17:15:19,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:19,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 17:15:19,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:15:19,935 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1747491563, now seen corresponding path program 1 times [2022-11-25 17:15:19,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:19,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785933303] [2022-11-25 17:15:19,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:19,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:20,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:20,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785933303] [2022-11-25 17:15:20,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785933303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:20,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:20,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:15:20,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437670570] [2022-11-25 17:15:20,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:20,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:20,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:20,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:20,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:15:20,084 INFO L87 Difference]: Start difference. First operand 261 states and 287 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-11-25 17:15:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:20,497 INFO L93 Difference]: Finished difference Result 439 states and 489 transitions. [2022-11-25 17:15:20,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:20,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-25 17:15:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:20,500 INFO L225 Difference]: With dead ends: 439 [2022-11-25 17:15:20,500 INFO L226 Difference]: Without dead ends: 439 [2022-11-25 17:15:20,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:15:20,512 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 199 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:20,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 569 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:15:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-11-25 17:15:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 259. [2022-11-25 17:15:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 140 states have (on average 1.9142857142857144) internal successors, (268), 256 states have internal predecessors, (268), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 285 transitions. [2022-11-25 17:15:20,544 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 285 transitions. Word has length 6 [2022-11-25 17:15:20,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:20,544 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 285 transitions. [2022-11-25 17:15:20,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-11-25 17:15:20,545 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 285 transitions. [2022-11-25 17:15:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 17:15:20,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:20,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 17:15:20,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:15:20,546 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:20,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:20,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1747491564, now seen corresponding path program 1 times [2022-11-25 17:15:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:20,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186668395] [2022-11-25 17:15:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:20,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:20,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:20,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186668395] [2022-11-25 17:15:20,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186668395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:20,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:20,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:15:20,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570708762] [2022-11-25 17:15:20,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:20,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:20,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:20,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:20,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:15:20,664 INFO L87 Difference]: Start difference. First operand 259 states and 285 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-11-25 17:15:20,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:20,957 INFO L93 Difference]: Finished difference Result 400 states and 444 transitions. [2022-11-25 17:15:20,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:20,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-25 17:15:20,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:20,960 INFO L225 Difference]: With dead ends: 400 [2022-11-25 17:15:20,960 INFO L226 Difference]: Without dead ends: 400 [2022-11-25 17:15:20,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:15:20,962 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 162 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:20,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 560 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:15:20,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-11-25 17:15:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 257. [2022-11-25 17:15:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 140 states have (on average 1.9) internal successors, (266), 254 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:20,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 283 transitions. [2022-11-25 17:15:20,973 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 283 transitions. Word has length 6 [2022-11-25 17:15:20,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:20,974 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 283 transitions. [2022-11-25 17:15:20,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-11-25 17:15:20,974 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 283 transitions. [2022-11-25 17:15:20,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 17:15:20,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:20,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:20,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:15:20,976 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:20,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:20,976 INFO L85 PathProgramCache]: Analyzing trace with hash 6274696, now seen corresponding path program 1 times [2022-11-25 17:15:20,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:20,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857427851] [2022-11-25 17:15:20,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:20,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:21,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857427851] [2022-11-25 17:15:21,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857427851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:21,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:21,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:15:21,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52013009] [2022-11-25 17:15:21,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:21,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:21,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:21,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:21,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:15:21,017 INFO L87 Difference]: Start difference. First operand 257 states and 283 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:21,049 INFO L93 Difference]: Finished difference Result 272 states and 296 transitions. [2022-11-25 17:15:21,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:21,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2022-11-25 17:15:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:21,051 INFO L225 Difference]: With dead ends: 272 [2022-11-25 17:15:21,051 INFO L226 Difference]: Without dead ends: 271 [2022-11-25 17:15:21,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:15:21,052 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 14 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:21,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 537 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:15:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-11-25 17:15:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 256. [2022-11-25 17:15:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 139 states have (on average 1.8992805755395683) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 281 transitions. [2022-11-25 17:15:21,061 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 281 transitions. Word has length 8 [2022-11-25 17:15:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:21,061 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 281 transitions. [2022-11-25 17:15:21,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 281 transitions. [2022-11-25 17:15:21,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 17:15:21,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:21,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:21,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:15:21,070 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:21,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash -849555632, now seen corresponding path program 1 times [2022-11-25 17:15:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:21,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949175962] [2022-11-25 17:15:21,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:21,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:21,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:21,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949175962] [2022-11-25 17:15:21,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949175962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:21,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:21,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:15:21,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491316398] [2022-11-25 17:15:21,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:21,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:21,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:21,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:21,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:15:21,271 INFO L87 Difference]: Start difference. First operand 256 states and 281 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-11-25 17:15:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:21,477 INFO L93 Difference]: Finished difference Result 342 states and 375 transitions. [2022-11-25 17:15:21,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:21,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-25 17:15:21,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:21,479 INFO L225 Difference]: With dead ends: 342 [2022-11-25 17:15:21,480 INFO L226 Difference]: Without dead ends: 342 [2022-11-25 17:15:21,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:15:21,483 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 160 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:21,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 346 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:15:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-11-25 17:15:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 254. [2022-11-25 17:15:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 139 states have (on average 1.8848920863309353) internal successors, (262), 251 states have internal predecessors, (262), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 279 transitions. [2022-11-25 17:15:21,506 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 279 transitions. Word has length 11 [2022-11-25 17:15:21,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:21,506 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 279 transitions. [2022-11-25 17:15:21,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-11-25 17:15:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 279 transitions. [2022-11-25 17:15:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 17:15:21,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:21,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:21,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:15:21,508 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:21,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:21,508 INFO L85 PathProgramCache]: Analyzing trace with hash -849555633, now seen corresponding path program 1 times [2022-11-25 17:15:21,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:21,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643513034] [2022-11-25 17:15:21,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:21,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:21,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:21,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643513034] [2022-11-25 17:15:21,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643513034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:21,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:21,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:15:21,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177891966] [2022-11-25 17:15:21,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:21,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:15:21,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:21,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:15:21,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:15:21,621 INFO L87 Difference]: Start difference. First operand 254 states and 279 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-11-25 17:15:21,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:21,881 INFO L93 Difference]: Finished difference Result 377 states and 416 transitions. [2022-11-25 17:15:21,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:15:21,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-25 17:15:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:21,884 INFO L225 Difference]: With dead ends: 377 [2022-11-25 17:15:21,884 INFO L226 Difference]: Without dead ends: 377 [2022-11-25 17:15:21,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:15:21,885 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 193 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:21,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 312 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:15:21,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-25 17:15:21,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 252. [2022-11-25 17:15:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 139 states have (on average 1.870503597122302) internal successors, (260), 249 states have internal predecessors, (260), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 277 transitions. [2022-11-25 17:15:21,896 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 277 transitions. Word has length 11 [2022-11-25 17:15:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:21,896 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 277 transitions. [2022-11-25 17:15:21,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-11-25 17:15:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 277 transitions. [2022-11-25 17:15:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 17:15:21,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:21,897 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:21,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:15:21,898 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:21,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:21,899 INFO L85 PathProgramCache]: Analyzing trace with hash 321246795, now seen corresponding path program 1 times [2022-11-25 17:15:21,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:21,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315414191] [2022-11-25 17:15:21,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:21,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:22,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:22,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315414191] [2022-11-25 17:15:22,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315414191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:22,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:22,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:15:22,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122124836] [2022-11-25 17:15:22,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:22,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:15:22,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:22,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:15:22,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:15:22,036 INFO L87 Difference]: Start difference. First operand 252 states and 277 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:22,108 INFO L93 Difference]: Finished difference Result 407 states and 447 transitions. [2022-11-25 17:15:22,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:15:22,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 17:15:22,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:22,111 INFO L225 Difference]: With dead ends: 407 [2022-11-25 17:15:22,111 INFO L226 Difference]: Without dead ends: 407 [2022-11-25 17:15:22,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:15:22,112 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 602 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:22,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 508 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:15:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-25 17:15:22,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 252. [2022-11-25 17:15:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 139 states have (on average 1.8633093525179856) internal successors, (259), 249 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:22,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 276 transitions. [2022-11-25 17:15:22,121 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 276 transitions. Word has length 17 [2022-11-25 17:15:22,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:22,122 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 276 transitions. [2022-11-25 17:15:22,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 276 transitions. [2022-11-25 17:15:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 17:15:22,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:22,123 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:22,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:15:22,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:22,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash -519843690, now seen corresponding path program 1 times [2022-11-25 17:15:22,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:22,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294175091] [2022-11-25 17:15:22,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:22,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:22,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:22,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294175091] [2022-11-25 17:15:22,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294175091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:22,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:22,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:15:22,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840470516] [2022-11-25 17:15:22,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:22,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:15:22,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:22,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:15:22,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:15:22,208 INFO L87 Difference]: Start difference. First operand 252 states and 276 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:22,387 INFO L93 Difference]: Finished difference Result 714 states and 789 transitions. [2022-11-25 17:15:22,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:15:22,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 19 [2022-11-25 17:15:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:22,391 INFO L225 Difference]: With dead ends: 714 [2022-11-25 17:15:22,391 INFO L226 Difference]: Without dead ends: 714 [2022-11-25 17:15:22,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-11-25 17:15:22,394 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 1479 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:22,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1481 Valid, 705 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:15:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-11-25 17:15:22,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 280. [2022-11-25 17:15:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 277 states have internal predecessors, (312), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 328 transitions. [2022-11-25 17:15:22,408 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 328 transitions. Word has length 19 [2022-11-25 17:15:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:22,408 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 328 transitions. [2022-11-25 17:15:22,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 328 transitions. [2022-11-25 17:15:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 17:15:22,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:22,410 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:22,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:15:22,411 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:22,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash -519854939, now seen corresponding path program 1 times [2022-11-25 17:15:22,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:22,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129845899] [2022-11-25 17:15:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:22,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:22,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:22,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129845899] [2022-11-25 17:15:22,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129845899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:22,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:22,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:15:22,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698296481] [2022-11-25 17:15:22,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:22,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:15:22,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:22,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:15:22,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:15:22,514 INFO L87 Difference]: Start difference. First operand 280 states and 328 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-11-25 17:15:23,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:23,001 INFO L93 Difference]: Finished difference Result 466 states and 533 transitions. [2022-11-25 17:15:23,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:15:23,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-11-25 17:15:23,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:23,003 INFO L225 Difference]: With dead ends: 466 [2022-11-25 17:15:23,004 INFO L226 Difference]: Without dead ends: 466 [2022-11-25 17:15:23,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:15:23,004 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 646 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:23,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 547 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:15:23,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-11-25 17:15:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 271. [2022-11-25 17:15:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 168 states have (on average 1.7857142857142858) internal successors, (300), 268 states have internal predecessors, (300), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 316 transitions. [2022-11-25 17:15:23,013 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 316 transitions. Word has length 19 [2022-11-25 17:15:23,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:23,014 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 316 transitions. [2022-11-25 17:15:23,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-11-25 17:15:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 316 transitions. [2022-11-25 17:15:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 17:15:23,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:23,015 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:23,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:15:23,015 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:23,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:23,016 INFO L85 PathProgramCache]: Analyzing trace with hash -519854938, now seen corresponding path program 1 times [2022-11-25 17:15:23,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:23,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948227799] [2022-11-25 17:15:23,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:23,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:23,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:23,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948227799] [2022-11-25 17:15:23,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948227799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:23,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:23,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:15:23,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910442600] [2022-11-25 17:15:23,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:23,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:15:23,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:23,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:15:23,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:15:23,197 INFO L87 Difference]: Start difference. First operand 271 states and 316 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-11-25 17:15:23,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:23,702 INFO L93 Difference]: Finished difference Result 606 states and 668 transitions. [2022-11-25 17:15:23,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:15:23,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-11-25 17:15:23,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:23,705 INFO L225 Difference]: With dead ends: 606 [2022-11-25 17:15:23,705 INFO L226 Difference]: Without dead ends: 606 [2022-11-25 17:15:23,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:15:23,706 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 891 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:23,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 571 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:15:23,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-25 17:15:23,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 291. [2022-11-25 17:15:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 188 states have (on average 1.7234042553191489) internal successors, (324), 288 states have internal predecessors, (324), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 340 transitions. [2022-11-25 17:15:23,714 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 340 transitions. Word has length 19 [2022-11-25 17:15:23,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:23,715 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 340 transitions. [2022-11-25 17:15:23,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-11-25 17:15:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 340 transitions. [2022-11-25 17:15:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 17:15:23,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:23,716 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:23,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:15:23,716 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:23,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:23,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1987558854, now seen corresponding path program 1 times [2022-11-25 17:15:23,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:23,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608658831] [2022-11-25 17:15:23,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:23,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:15:23,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:23,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608658831] [2022-11-25 17:15:23,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608658831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:23,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:23,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:15:23,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459500304] [2022-11-25 17:15:23,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:23,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:15:23,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:23,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:15:23,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:15:23,835 INFO L87 Difference]: Start difference. First operand 291 states and 340 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:24,030 INFO L93 Difference]: Finished difference Result 373 states and 428 transitions. [2022-11-25 17:15:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:15:24,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 26 [2022-11-25 17:15:24,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:24,032 INFO L225 Difference]: With dead ends: 373 [2022-11-25 17:15:24,032 INFO L226 Difference]: Without dead ends: 373 [2022-11-25 17:15:24,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-25 17:15:24,033 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 104 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:24,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 838 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:15:24,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-11-25 17:15:24,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 290. [2022-11-25 17:15:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 188 states have (on average 1.7127659574468086) internal successors, (322), 287 states have internal predecessors, (322), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 337 transitions. [2022-11-25 17:15:24,040 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 337 transitions. Word has length 26 [2022-11-25 17:15:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:24,041 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 337 transitions. [2022-11-25 17:15:24,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 337 transitions. [2022-11-25 17:15:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 17:15:24,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:24,042 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:24,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:15:24,042 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1626991364, now seen corresponding path program 1 times [2022-11-25 17:15:24,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:24,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412586336] [2022-11-25 17:15:24,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:15:24,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:24,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412586336] [2022-11-25 17:15:24,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412586336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:24,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:24,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:15:24,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83341497] [2022-11-25 17:15:24,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:24,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:15:24,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:24,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:15:24,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:15:24,140 INFO L87 Difference]: Start difference. First operand 290 states and 337 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:24,304 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2022-11-25 17:15:24,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:15:24,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 26 [2022-11-25 17:15:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:24,306 INFO L225 Difference]: With dead ends: 289 [2022-11-25 17:15:24,306 INFO L226 Difference]: Without dead ends: 289 [2022-11-25 17:15:24,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-25 17:15:24,307 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 20 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:24,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 863 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:15:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-25 17:15:24,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-11-25 17:15:24,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.702127659574468) internal successors, (320), 286 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 334 transitions. [2022-11-25 17:15:24,314 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 334 transitions. Word has length 26 [2022-11-25 17:15:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:24,314 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 334 transitions. [2022-11-25 17:15:24,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:24,314 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 334 transitions. [2022-11-25 17:15:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 17:15:24,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:24,315 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 17:15:24,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:15:24,315 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:24,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:24,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1169692160, now seen corresponding path program 1 times [2022-11-25 17:15:24,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:24,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088095101] [2022-11-25 17:15:24,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:24,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:24,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:24,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088095101] [2022-11-25 17:15:24,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088095101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:24,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:24,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:15:24,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041004212] [2022-11-25 17:15:24,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:24,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:15:24,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:24,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:15:24,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:15:24,501 INFO L87 Difference]: Start difference. First operand 289 states and 334 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:24,878 INFO L93 Difference]: Finished difference Result 604 states and 661 transitions. [2022-11-25 17:15:24,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:15:24,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 29 [2022-11-25 17:15:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:24,881 INFO L225 Difference]: With dead ends: 604 [2022-11-25 17:15:24,882 INFO L226 Difference]: Without dead ends: 604 [2022-11-25 17:15:24,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:15:24,882 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 1290 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:24,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 1040 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:15:24,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-11-25 17:15:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 289. [2022-11-25 17:15:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.696808510638298) internal successors, (319), 286 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 333 transitions. [2022-11-25 17:15:24,894 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 333 transitions. Word has length 29 [2022-11-25 17:15:24,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:24,899 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 333 transitions. [2022-11-25 17:15:24,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:24,900 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 333 transitions. [2022-11-25 17:15:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 17:15:24,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:24,902 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 17:15:24,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:15:24,903 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:24,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:24,903 INFO L85 PathProgramCache]: Analyzing trace with hash 698957523, now seen corresponding path program 1 times [2022-11-25 17:15:24,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:24,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104084585] [2022-11-25 17:15:24,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:24,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:25,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:25,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104084585] [2022-11-25 17:15:25,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104084585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:25,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:25,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:15:25,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928128002] [2022-11-25 17:15:25,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:25,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:15:25,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:25,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:15:25,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:15:25,191 INFO L87 Difference]: Start difference. First operand 289 states and 333 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:25,549 INFO L93 Difference]: Finished difference Result 603 states and 659 transitions. [2022-11-25 17:15:25,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:15:25,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 29 [2022-11-25 17:15:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:25,552 INFO L225 Difference]: With dead ends: 603 [2022-11-25 17:15:25,552 INFO L226 Difference]: Without dead ends: 603 [2022-11-25 17:15:25,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:15:25,553 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 1286 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:25,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 1040 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:15:25,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-11-25 17:15:25,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 289. [2022-11-25 17:15:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.6914893617021276) internal successors, (318), 286 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 332 transitions. [2022-11-25 17:15:25,561 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 332 transitions. Word has length 29 [2022-11-25 17:15:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:25,562 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 332 transitions. [2022-11-25 17:15:25,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 332 transitions. [2022-11-25 17:15:25,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 17:15:25,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:25,563 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 17:15:25,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:15:25,563 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:25,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:25,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1900933732, now seen corresponding path program 1 times [2022-11-25 17:15:25,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:25,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992315869] [2022-11-25 17:15:25,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:25,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:25,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:25,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992315869] [2022-11-25 17:15:25,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992315869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:25,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:25,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:15:25,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455133319] [2022-11-25 17:15:25,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:25,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:15:25,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:25,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:15:25,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:15:25,851 INFO L87 Difference]: Start difference. First operand 289 states and 332 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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-11-25 17:15:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:26,731 INFO L93 Difference]: Finished difference Result 676 states and 747 transitions. [2022-11-25 17:15:26,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:15:26,732 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-25 17:15:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:26,734 INFO L225 Difference]: With dead ends: 676 [2022-11-25 17:15:26,734 INFO L226 Difference]: Without dead ends: 676 [2022-11-25 17:15:26,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-11-25 17:15:26,735 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 1257 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:26,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 916 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 17:15:26,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-11-25 17:15:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 290. [2022-11-25 17:15:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.693121693121693) internal successors, (320), 287 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 334 transitions. [2022-11-25 17:15:26,745 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 334 transitions. Word has length 30 [2022-11-25 17:15:26,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:26,745 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 334 transitions. [2022-11-25 17:15:26,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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-11-25 17:15:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 334 transitions. [2022-11-25 17:15:26,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 17:15:26,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:26,747 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 17:15:26,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:15:26,747 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:26,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1900933731, now seen corresponding path program 1 times [2022-11-25 17:15:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:26,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48347642] [2022-11-25 17:15:26,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:26,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:27,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:27,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48347642] [2022-11-25 17:15:27,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48347642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:27,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:27,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:15:27,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119928506] [2022-11-25 17:15:27,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:27,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:15:27,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:27,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:15:27,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:15:27,123 INFO L87 Difference]: Start difference. First operand 290 states and 334 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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-11-25 17:15:28,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:28,382 INFO L93 Difference]: Finished difference Result 801 states and 880 transitions. [2022-11-25 17:15:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:15:28,384 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-25 17:15:28,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:28,387 INFO L225 Difference]: With dead ends: 801 [2022-11-25 17:15:28,387 INFO L226 Difference]: Without dead ends: 801 [2022-11-25 17:15:28,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:15:28,388 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 1652 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:28,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 886 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 17:15:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-11-25 17:15:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 290. [2022-11-25 17:15:28,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.687830687830688) internal successors, (319), 287 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 333 transitions. [2022-11-25 17:15:28,398 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 333 transitions. Word has length 30 [2022-11-25 17:15:28,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:28,399 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 333 transitions. [2022-11-25 17:15:28,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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-11-25 17:15:28,399 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 333 transitions. [2022-11-25 17:15:28,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 17:15:28,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:28,400 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 17:15:28,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 17:15:28,400 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:28,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash 192556862, now seen corresponding path program 1 times [2022-11-25 17:15:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:28,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610293449] [2022-11-25 17:15:28,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:28,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:28,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:28,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610293449] [2022-11-25 17:15:28,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610293449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:28,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:28,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:15:28,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338941223] [2022-11-25 17:15:28,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:28,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:15:28,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:28,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:15:28,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:15:28,688 INFO L87 Difference]: Start difference. First operand 290 states and 333 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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-11-25 17:15:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:29,587 INFO L93 Difference]: Finished difference Result 674 states and 745 transitions. [2022-11-25 17:15:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:15:29,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-25 17:15:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:29,590 INFO L225 Difference]: With dead ends: 674 [2022-11-25 17:15:29,590 INFO L226 Difference]: Without dead ends: 674 [2022-11-25 17:15:29,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-11-25 17:15:29,591 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 1439 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:29,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1441 Valid, 985 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 17:15:29,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-11-25 17:15:29,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 290. [2022-11-25 17:15:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.6825396825396826) internal successors, (318), 287 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 332 transitions. [2022-11-25 17:15:29,601 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 332 transitions. Word has length 30 [2022-11-25 17:15:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:29,602 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 332 transitions. [2022-11-25 17:15:29,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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-11-25 17:15:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 332 transitions. [2022-11-25 17:15:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 17:15:29,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:29,603 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 17:15:29,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 17:15:29,603 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:29,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash 192556863, now seen corresponding path program 1 times [2022-11-25 17:15:29,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:29,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909059437] [2022-11-25 17:15:29,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:29,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:30,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:30,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909059437] [2022-11-25 17:15:30,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909059437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:30,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:15:30,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:15:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677686535] [2022-11-25 17:15:30,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:30,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:15:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:30,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:15:30,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:15:30,016 INFO L87 Difference]: Start difference. First operand 290 states and 332 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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-11-25 17:15:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:31,199 INFO L93 Difference]: Finished difference Result 799 states and 878 transitions. [2022-11-25 17:15:31,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:15:31,201 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-25 17:15:31,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:31,204 INFO L225 Difference]: With dead ends: 799 [2022-11-25 17:15:31,204 INFO L226 Difference]: Without dead ends: 799 [2022-11-25 17:15:31,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:15:31,205 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 1642 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1642 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:31,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1642 Valid, 861 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 17:15:31,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-11-25 17:15:31,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 290. [2022-11-25 17:15:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.6772486772486772) internal successors, (317), 287 states have internal predecessors, (317), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:15:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 331 transitions. [2022-11-25 17:15:31,217 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 331 transitions. Word has length 30 [2022-11-25 17:15:31,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:31,217 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 331 transitions. [2022-11-25 17:15:31,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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-11-25 17:15:31,217 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 331 transitions. [2022-11-25 17:15:31,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 17:15:31,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:31,219 INFO L195 NwaCegarLoop]: trace histogram [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-11-25 17:15:31,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 17:15:31,219 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-25 17:15:31,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1572782387, now seen corresponding path program 1 times [2022-11-25 17:15:31,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:31,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526379666] [2022-11-25 17:15:31,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:31,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:15:31,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:15:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:15:31,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:15:31,307 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:15:31,308 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (104 of 105 remaining) [2022-11-25 17:15:31,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 105 remaining) [2022-11-25 17:15:31,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 105 remaining) [2022-11-25 17:15:31,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 105 remaining) [2022-11-25 17:15:31,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 105 remaining) [2022-11-25 17:15:31,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 105 remaining) [2022-11-25 17:15:31,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 105 remaining) [2022-11-25 17:15:31,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 105 remaining) [2022-11-25 17:15:31,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 105 remaining) [2022-11-25 17:15:31,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 105 remaining) [2022-11-25 17:15:31,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 105 remaining) [2022-11-25 17:15:31,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 105 remaining) [2022-11-25 17:15:31,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 105 remaining) [2022-11-25 17:15:31,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 105 remaining) [2022-11-25 17:15:31,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 105 remaining) [2022-11-25 17:15:31,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 105 remaining) [2022-11-25 17:15:31,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 105 remaining) [2022-11-25 17:15:31,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 105 remaining) [2022-11-25 17:15:31,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 105 remaining) [2022-11-25 17:15:31,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 105 remaining) [2022-11-25 17:15:31,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 105 remaining) [2022-11-25 17:15:31,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 105 remaining) [2022-11-25 17:15:31,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 105 remaining) [2022-11-25 17:15:31,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 105 remaining) [2022-11-25 17:15:31,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 105 remaining) [2022-11-25 17:15:31,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 105 remaining) [2022-11-25 17:15:31,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 105 remaining) [2022-11-25 17:15:31,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 105 remaining) [2022-11-25 17:15:31,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 105 remaining) [2022-11-25 17:15:31,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 105 remaining) [2022-11-25 17:15:31,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 105 remaining) [2022-11-25 17:15:31,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 105 remaining) [2022-11-25 17:15:31,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 105 remaining) [2022-11-25 17:15:31,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 105 remaining) [2022-11-25 17:15:31,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 105 remaining) [2022-11-25 17:15:31,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 105 remaining) [2022-11-25 17:15:31,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 105 remaining) [2022-11-25 17:15:31,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 105 remaining) [2022-11-25 17:15:31,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 105 remaining) [2022-11-25 17:15:31,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 105 remaining) [2022-11-25 17:15:31,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 105 remaining) [2022-11-25 17:15:31,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 105 remaining) [2022-11-25 17:15:31,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 105 remaining) [2022-11-25 17:15:31,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 105 remaining) [2022-11-25 17:15:31,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 105 remaining) [2022-11-25 17:15:31,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 105 remaining) [2022-11-25 17:15:31,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 105 remaining) [2022-11-25 17:15:31,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 105 remaining) [2022-11-25 17:15:31,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 105 remaining) [2022-11-25 17:15:31,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 105 remaining) [2022-11-25 17:15:31,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 105 remaining) [2022-11-25 17:15:31,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 105 remaining) [2022-11-25 17:15:31,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 105 remaining) [2022-11-25 17:15:31,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 105 remaining) [2022-11-25 17:15:31,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 105 remaining) [2022-11-25 17:15:31,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 105 remaining) [2022-11-25 17:15:31,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 105 remaining) [2022-11-25 17:15:31,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 105 remaining) [2022-11-25 17:15:31,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 105 remaining) [2022-11-25 17:15:31,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 105 remaining) [2022-11-25 17:15:31,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 105 remaining) [2022-11-25 17:15:31,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 105 remaining) [2022-11-25 17:15:31,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 105 remaining) [2022-11-25 17:15:31,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 105 remaining) [2022-11-25 17:15:31,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 105 remaining) [2022-11-25 17:15:31,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 105 remaining) [2022-11-25 17:15:31,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 105 remaining) [2022-11-25 17:15:31,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 105 remaining) [2022-11-25 17:15:31,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 105 remaining) [2022-11-25 17:15:31,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 105 remaining) [2022-11-25 17:15:31,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 105 remaining) [2022-11-25 17:15:31,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 105 remaining) [2022-11-25 17:15:31,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 105 remaining) [2022-11-25 17:15:31,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 105 remaining) [2022-11-25 17:15:31,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 105 remaining) [2022-11-25 17:15:31,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 105 remaining) [2022-11-25 17:15:31,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 105 remaining) [2022-11-25 17:15:31,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 105 remaining) [2022-11-25 17:15:31,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 105 remaining) [2022-11-25 17:15:31,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (25 of 105 remaining) [2022-11-25 17:15:31,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (24 of 105 remaining) [2022-11-25 17:15:31,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE (23 of 105 remaining) [2022-11-25 17:15:31,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 105 remaining) [2022-11-25 17:15:31,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 105 remaining) [2022-11-25 17:15:31,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 105 remaining) [2022-11-25 17:15:31,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 105 remaining) [2022-11-25 17:15:31,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 105 remaining) [2022-11-25 17:15:31,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 105 remaining) [2022-11-25 17:15:31,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 105 remaining) [2022-11-25 17:15:31,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 105 remaining) [2022-11-25 17:15:31,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 105 remaining) [2022-11-25 17:15:31,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 105 remaining) [2022-11-25 17:15:31,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 105 remaining) [2022-11-25 17:15:31,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 105 remaining) [2022-11-25 17:15:31,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 105 remaining) [2022-11-25 17:15:31,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 105 remaining) [2022-11-25 17:15:31,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE (8 of 105 remaining) [2022-11-25 17:15:31,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE (7 of 105 remaining) [2022-11-25 17:15:31,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE (6 of 105 remaining) [2022-11-25 17:15:31,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 105 remaining) [2022-11-25 17:15:31,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 105 remaining) [2022-11-25 17:15:31,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONMEMORY_FREE (3 of 105 remaining) [2022-11-25 17:15:31,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_FREE (2 of 105 remaining) [2022-11-25 17:15:31,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE (1 of 105 remaining) [2022-11-25 17:15:31,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK (0 of 105 remaining) [2022-11-25 17:15:31,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 17:15:31,339 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] [2022-11-25 17:15:31,346 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:15:31,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:15:31 BoogieIcfgContainer [2022-11-25 17:15:31,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:15:31,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:15:31,396 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:15:31,396 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:15:31,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:15:18" (3/4) ... [2022-11-25 17:15:31,398 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:15:31,468 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:15:31,468 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:15:31,469 INFO L158 Benchmark]: Toolchain (without parser) took 14431.27ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 110.5MB in the beginning and 71.0MB in the end (delta: 39.5MB). Peak memory consumption was 78.3MB. Max. memory is 16.1GB. [2022-11-25 17:15:31,469 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 123.7MB. Free memory was 88.2MB in the beginning and 88.1MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:15:31,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 654.37ms. Allocated memory is still 157.3MB. Free memory was 110.5MB in the beginning and 92.0MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 17:15:31,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.26ms. Allocated memory is still 157.3MB. Free memory was 92.0MB in the beginning and 88.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:15:31,470 INFO L158 Benchmark]: Boogie Preprocessor took 89.29ms. Allocated memory is still 157.3MB. Free memory was 88.9MB in the beginning and 86.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:15:31,470 INFO L158 Benchmark]: RCFGBuilder took 1149.99ms. Allocated memory is still 157.3MB. Free memory was 86.3MB in the beginning and 105.8MB in the end (delta: -19.5MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2022-11-25 17:15:31,475 INFO L158 Benchmark]: TraceAbstraction took 12399.65ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 104.7MB in the beginning and 73.1MB in the end (delta: 31.6MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB. [2022-11-25 17:15:31,476 INFO L158 Benchmark]: Witness Printer took 72.26ms. Allocated memory is still 192.9MB. Free memory was 73.1MB in the beginning and 71.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:15:31,480 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.26ms. Allocated memory is still 123.7MB. Free memory was 88.2MB in the beginning and 88.1MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 654.37ms. Allocated memory is still 157.3MB. Free memory was 110.5MB in the beginning and 92.0MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.26ms. Allocated memory is still 157.3MB. Free memory was 92.0MB in the beginning and 88.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.29ms. Allocated memory is still 157.3MB. Free memory was 88.9MB in the beginning and 86.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1149.99ms. Allocated memory is still 157.3MB. Free memory was 86.3MB in the beginning and 105.8MB in the end (delta: -19.5MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12399.65ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 104.7MB in the beginning and 73.1MB in the end (delta: 31.6MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB. * Witness Printer took 72.26ms. Allocated memory is still 192.9MB. Free memory was 73.1MB in the beginning and 71.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L638] struct list *data = ((void *)0); VAL [data={0:0}] [L639] COND TRUE __VERIFIER_nondet_int() [L640] struct node *node = malloc(sizeof *node); [L641] COND FALSE !(!node) VAL [data={0:0}, node={-1:0}] [L643] node->next = node VAL [data={0:0}, node={-1:0}] [L644] node->value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, data={0:0}, node={-1:0}] [L645] struct list *item = malloc(sizeof *item); [L646] COND FALSE !(!item) VAL [data={0:0}, item={-3:0}, node={-1:0}] [L648] item->slist = node VAL [data={0:0}, item={-3:0}, node={-1:0}] [L649] item->next = data VAL [data={0:0}, item={-3:0}, node={-1:0}] [L650] data = item VAL [data={-3:0}, item={-3:0}, node={-1:0}] [L639] COND FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) [L654] CALL inspect_before(data) [L615] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L616] shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L616] COND FALSE !(shape->next) [L622] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L623] EXPR shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L623] COND FALSE !(!(shape->next == ((void *)0))) [L624] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L624] COND FALSE !(!(shape->slist)) [L625] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L625] EXPR shape->slist->next VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}, shape->slist->next={-1:0}] [L625] COND TRUE !(shape->slist->next == ((void *)0)) [L625] 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: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free 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: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free 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: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: 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 3 procedures, 262 locations, 105 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13187 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13169 mSDsluCounter, 12765 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8280 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6284 IncrementalHoareTripleChecker+Invalid, 6473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 4485 mSDtfsCounter, 6284 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred in iteration=11, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 4281 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 338 ConstructedInterpolants, 0 QuantifiedInterpolants, 2222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 24/24 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-11-25 17:15:31,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28eeb59e-3958-4fe9-b395-8c2bce6c6801/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)