./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8 --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 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 --- 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-e04fb08 [2022-11-16 11:42:17,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:42:17,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:42:17,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:42:17,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:42:17,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:42:17,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:42:17,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:42:17,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:42:17,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:42:17,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:42:17,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:42:17,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:42:17,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:42:17,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:42:17,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:42:17,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:42:17,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:42:17,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:42:17,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:42:17,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:42:17,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:42:17,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:42:17,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:42:17,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:42:17,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:42:17,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:42:17,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:42:17,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:42:17,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:42:17,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:42:17,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:42:17,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:42:17,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:42:17,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:42:17,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:42:17,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:42:17,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:42:17,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:42:17,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:42:17,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:42:17,253 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-11-16 11:42:17,278 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:42:17,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:42:17,279 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:42:17,279 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:42:17,280 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:42:17,280 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:42:17,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:42:17,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:42:17,281 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:42:17,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:42:17,282 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:42:17,282 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:42:17,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:42:17,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:42:17,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:42:17,283 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:42:17,283 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:42:17,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:42:17,284 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:42:17,284 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:42:17,284 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:42:17,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:42:17,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:42:17,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:42:17,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:42:17,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:42:17,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:42:17,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:42:17,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:42:17,286 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/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_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8 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 -> 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 [2022-11-16 11:42:17,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:42:17,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:42:17,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:42:17,627 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:42:17,630 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:42:17,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2022-11-16 11:42:17,724 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/data/e8ebfff64/4c3b4016068842979e3e97370349fca1/FLAG0aba5ca59 [2022-11-16 11:42:18,378 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:42:18,378 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2022-11-16 11:42:18,397 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/data/e8ebfff64/4c3b4016068842979e3e97370349fca1/FLAG0aba5ca59 [2022-11-16 11:42:18,607 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/data/e8ebfff64/4c3b4016068842979e3e97370349fca1 [2022-11-16 11:42:18,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:42:18,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:42:18,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:42:18,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:42:18,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:42:18,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:42:18" (1/1) ... [2022-11-16 11:42:18,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef00741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:18, skipping insertion in model container [2022-11-16 11:42:18,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:42:18" (1/1) ... [2022-11-16 11:42:18,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:42:18,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:42:19,179 WARN L229 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_a2a03009-1c92-4e24-a6c7-92a37856b9a5/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i[24046,24059] [2022-11-16 11:42:19,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:42:19,205 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:42:19,284 WARN L229 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_a2a03009-1c92-4e24-a6c7-92a37856b9a5/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i[24046,24059] [2022-11-16 11:42:19,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:42:19,330 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:42:19,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:19 WrapperNode [2022-11-16 11:42:19,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:42:19,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:42:19,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:42:19,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:42:19,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:19" (1/1) ... [2022-11-16 11:42:19,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:19" (1/1) ... [2022-11-16 11:42:19,420 INFO L138 Inliner]: procedures = 123, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 113 [2022-11-16 11:42:19,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:42:19,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:42:19,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:42:19,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:42:19,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:19" (1/1) ... [2022-11-16 11:42:19,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:19" (1/1) ... [2022-11-16 11:42:19,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:19" (1/1) ... [2022-11-16 11:42:19,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:19" (1/1) ... [2022-11-16 11:42:19,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:19" (1/1) ... [2022-11-16 11:42:19,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:19" (1/1) ... [2022-11-16 11:42:19,488 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:19" (1/1) ... [2022-11-16 11:42:19,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:19" (1/1) ... [2022-11-16 11:42:19,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:42:19,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:42:19,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:42:19,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:42:19,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:19" (1/1) ... [2022-11-16 11:42:19,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:42:19,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:19,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:42:19,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:42:19,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:42:19,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:42:19,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:42:19,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:42:19,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:42:19,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:42:19,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:42:19,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:42:19,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:42:19,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:42:19,763 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:42:19,778 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:42:20,228 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:42:20,246 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:42:20,249 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 11:42:20,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:42:20 BoogieIcfgContainer [2022-11-16 11:42:20,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:42:20,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:42:20,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:42:20,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:42:20,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:42:18" (1/3) ... [2022-11-16 11:42:20,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0f7422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:42:20, skipping insertion in model container [2022-11-16 11:42:20,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:19" (2/3) ... [2022-11-16 11:42:20,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0f7422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:42:20, skipping insertion in model container [2022-11-16 11:42:20,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:42:20" (3/3) ... [2022-11-16 11:42:20,269 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2022-11-16 11:42:20,297 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:42:20,297 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2022-11-16 11:42:20,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:42:20,388 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@83b1520, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:42:20,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2022-11-16 11:42:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 86 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:20,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:42:20,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:20,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:42:20,407 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-16 11:42:20,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:20,419 INFO L85 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2022-11-16 11:42:20,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:20,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674899076] [2022-11-16 11:42:20,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:20,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:20,753 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-16 11:42:20,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:20,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674899076] [2022-11-16 11:42:20,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674899076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:20,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:20,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:20,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720732059] [2022-11-16 11:42:20,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:20,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:20,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:20,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:20,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:20,821 INFO L87 Difference]: Start difference. First operand has 87 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 86 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:21,087 INFO L93 Difference]: Finished difference Result 143 states and 159 transitions. [2022-11-16 11:42:21,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:21,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 11:42:21,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:21,130 INFO L225 Difference]: With dead ends: 143 [2022-11-16 11:42:21,130 INFO L226 Difference]: Without dead ends: 138 [2022-11-16 11:42:21,132 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-16 11:42:21,136 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 86 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:21,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 166 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:42:21,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-16 11:42:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 79. [2022-11-16 11:42:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 78 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-11-16 11:42:21,198 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 5 [2022-11-16 11:42:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:21,199 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-11-16 11:42:21,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-16 11:42:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-11-16 11:42:21,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:42:21,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:21,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:42:21,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:42:21,201 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-16 11:42:21,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:21,203 INFO L85 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2022-11-16 11:42:21,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:21,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282120322] [2022-11-16 11:42:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:21,374 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-16 11:42:21,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:21,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282120322] [2022-11-16 11:42:21,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282120322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:21,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:21,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:21,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830411816] [2022-11-16 11:42:21,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:21,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:21,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:21,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:21,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:21,380 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:21,530 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2022-11-16 11:42:21,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:21,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 11:42:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:21,532 INFO L225 Difference]: With dead ends: 133 [2022-11-16 11:42:21,533 INFO L226 Difference]: Without dead ends: 133 [2022-11-16 11:42:21,533 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-16 11:42:21,535 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 78 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:21,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 167 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:42:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-16 11:42:21,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 74. [2022-11-16 11:42:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 73 states have internal predecessors, (82), 0 states have call successors, (0), 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-16 11:42:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2022-11-16 11:42:21,543 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 5 [2022-11-16 11:42:21,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:21,544 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2022-11-16 11:42:21,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-16 11:42:21,544 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2022-11-16 11:42:21,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:42:21,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:21,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:42:21,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:42:21,546 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-16 11:42:21,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:21,547 INFO L85 PathProgramCache]: Analyzing trace with hash 889667569, now seen corresponding path program 1 times [2022-11-16 11:42:21,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:21,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435114817] [2022-11-16 11:42:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:21,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:21,591 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-16 11:42:21,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:21,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435114817] [2022-11-16 11:42:21,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435114817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:21,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:21,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:42:21,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043823974] [2022-11-16 11:42:21,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:21,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:21,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:21,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:21,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:21,595 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 3 states, 3 states have (on average 2.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-16 11:42:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:21,622 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-11-16 11:42:21,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:21,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.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-16 11:42:21,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:21,625 INFO L225 Difference]: With dead ends: 88 [2022-11-16 11:42:21,628 INFO L226 Difference]: Without dead ends: 88 [2022-11-16 11:42:21,629 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-16 11:42:21,630 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 14 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:21,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 156 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:42:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-16 11:42:21,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2022-11-16 11:42:21,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.66) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-11-16 11:42:21,639 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 6 [2022-11-16 11:42:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:21,640 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-11-16 11:42:21,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.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-16 11:42:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-11-16 11:42:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:42:21,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:21,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:21,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:42:21,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-16 11:42:21,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:21,642 INFO L85 PathProgramCache]: Analyzing trace with hash -689703723, now seen corresponding path program 1 times [2022-11-16 11:42:21,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:21,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517262649] [2022-11-16 11:42:21,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:21,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:21,781 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-16 11:42:21,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:21,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517262649] [2022-11-16 11:42:21,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517262649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:21,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:21,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:42:21,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246018875] [2022-11-16 11:42:21,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:21,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:21,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:21,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:21,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:21,785 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-16 11:42:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:21,808 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-11-16 11:42:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:21,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-11-16 11:42:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:21,810 INFO L225 Difference]: With dead ends: 85 [2022-11-16 11:42:21,810 INFO L226 Difference]: Without dead ends: 85 [2022-11-16 11:42:21,811 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-16 11:42:21,812 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:21,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 153 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:42:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-16 11:42:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-11-16 11:42:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 83 states have internal predecessors, (92), 0 states have call successors, (0), 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-16 11:42:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2022-11-16 11:42:21,820 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 13 [2022-11-16 11:42:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:21,821 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2022-11-16 11:42:21,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-16 11:42:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-11-16 11:42:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:42:21,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:21,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:21,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:42:21,823 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-16 11:42:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash 811010211, now seen corresponding path program 1 times [2022-11-16 11:42:21,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:21,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574281683] [2022-11-16 11:42:21,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:21,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:42:22,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:22,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574281683] [2022-11-16 11:42:22,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574281683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:22,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:22,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:42:22,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516999405] [2022-11-16 11:42:22,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:22,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:42:22,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:22,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:42:22,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:42:22,107 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-16 11:42:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:22,430 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-11-16 11:42:22,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:42:22,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-16 11:42:22,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:22,435 INFO L225 Difference]: With dead ends: 105 [2022-11-16 11:42:22,435 INFO L226 Difference]: Without dead ends: 105 [2022-11-16 11:42:22,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:42:22,444 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 257 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:22,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 107 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:42:22,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-16 11:42:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 78. [2022-11-16 11:42:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.435483870967742) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2022-11-16 11:42:22,471 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 17 [2022-11-16 11:42:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:22,472 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2022-11-16 11:42:22,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-16 11:42:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2022-11-16 11:42:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:42:22,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:22,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:22,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:42:22,476 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-16 11:42:22,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:22,481 INFO L85 PathProgramCache]: Analyzing trace with hash 811010212, now seen corresponding path program 1 times [2022-11-16 11:42:22,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:22,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761005692] [2022-11-16 11:42:22,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:22,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:42:22,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:22,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761005692] [2022-11-16 11:42:22,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761005692] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:42:22,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974489381] [2022-11-16 11:42:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:22,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:22,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:22,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:42:22,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:42:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:22,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:42:22,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:42:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:42:22,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:42:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:42:23,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974489381] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:42:23,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:42:23,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-16 11:42:23,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578348137] [2022-11-16 11:42:23,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:42:23,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:42:23,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:23,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:42:23,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:42:23,011 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-16 11:42:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:23,048 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-11-16 11:42:23,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:42:23,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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 17 [2022-11-16 11:42:23,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:23,050 INFO L225 Difference]: With dead ends: 106 [2022-11-16 11:42:23,050 INFO L226 Difference]: Without dead ends: 106 [2022-11-16 11:42:23,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:42:23,051 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 72 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:23,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 217 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:42:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-16 11:42:23,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-11-16 11:42:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 103 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2022-11-16 11:42:23,058 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 17 [2022-11-16 11:42:23,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:23,059 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2022-11-16 11:42:23,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-16 11:42:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2022-11-16 11:42:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 11:42:23,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:23,060 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:23,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:42:23,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:23,268 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-16 11:42:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2052349924, now seen corresponding path program 1 times [2022-11-16 11:42:23,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:23,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273095414] [2022-11-16 11:42:23,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:42:23,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:23,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273095414] [2022-11-16 11:42:23,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273095414] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:42:23,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273334759] [2022-11-16 11:42:23,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:23,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:23,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:23,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:42:23,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:42:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:23,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 11:42:23,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:42:23,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:42:23,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:42:24,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:24,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:42:24,054 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:42:24,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:42:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:42:24,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:42:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:42:24,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273334759] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:42:24,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:42:24,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2022-11-16 11:42:24,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680199174] [2022-11-16 11:42:24,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:42:24,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:42:24,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:24,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:42:24,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:42:24,557 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 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-16 11:42:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:24,782 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-11-16 11:42:24,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:42:24,783 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 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 24 [2022-11-16 11:42:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:24,784 INFO L225 Difference]: With dead ends: 128 [2022-11-16 11:42:24,784 INFO L226 Difference]: Without dead ends: 128 [2022-11-16 11:42:24,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:42:24,786 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 389 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:24,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 125 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2022-11-16 11:42:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-16 11:42:24,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 103. [2022-11-16 11:42:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2022-11-16 11:42:24,792 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 24 [2022-11-16 11:42:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:24,792 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-11-16 11:42:24,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 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-16 11:42:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2022-11-16 11:42:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-16 11:42:24,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:24,794 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:24,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:42:25,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 11:42:25,001 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-16 11:42:25,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:25,001 INFO L85 PathProgramCache]: Analyzing trace with hash 411380082, now seen corresponding path program 2 times [2022-11-16 11:42:25,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:25,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250195872] [2022-11-16 11:42:25,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:25,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 46 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 11:42:25,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:25,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250195872] [2022-11-16 11:42:25,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250195872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:42:25,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546287950] [2022-11-16 11:42:25,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:42:25,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:25,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:25,143 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:42:25,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:42:25,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:42:25,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:42:25,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:42:25,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:42:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:42:25,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:42:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:42:25,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546287950] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:42:25,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:42:25,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2022-11-16 11:42:25,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721344082] [2022-11-16 11:42:25,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:42:25,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:42:25,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:25,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:42:25,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:42:25,588 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:25,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:25,776 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2022-11-16 11:42:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:42:25,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-11-16 11:42:25,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:25,778 INFO L225 Difference]: With dead ends: 115 [2022-11-16 11:42:25,778 INFO L226 Difference]: Without dead ends: 115 [2022-11-16 11:42:25,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:42:25,779 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 195 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:25,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 187 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:42:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-16 11:42:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-16 11:42:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 100 states have (on average 1.25) internal successors, (125), 114 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2022-11-16 11:42:25,784 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 50 [2022-11-16 11:42:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:25,785 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2022-11-16 11:42:25,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2022-11-16 11:42:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 11:42:25,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:25,786 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:25,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:42:25,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-16 11:42:25,994 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-16 11:42:25,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:25,994 INFO L85 PathProgramCache]: Analyzing trace with hash -497478916, now seen corresponding path program 1 times [2022-11-16 11:42:25,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:25,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268245064] [2022-11-16 11:42:25,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:25,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-16 11:42:26,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:26,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268245064] [2022-11-16 11:42:26,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268245064] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:26,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:26,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:42:26,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374079014] [2022-11-16 11:42:26,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:26,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:42:26,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:26,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:42:26,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:42:26,699 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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-16 11:42:26,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:26,966 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2022-11-16 11:42:26,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:42:26,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-16 11:42:26,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:26,968 INFO L225 Difference]: With dead ends: 150 [2022-11-16 11:42:26,968 INFO L226 Difference]: Without dead ends: 150 [2022-11-16 11:42:26,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:42:26,969 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 346 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:26,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 79 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:42:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-16 11:42:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2022-11-16 11:42:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 126 states have (on average 1.253968253968254) internal successors, (158), 140 states have internal predecessors, (158), 0 states have call successors, (0), 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-16 11:42:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 158 transitions. [2022-11-16 11:42:26,975 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 158 transitions. Word has length 65 [2022-11-16 11:42:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:26,975 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 158 transitions. [2022-11-16 11:42:26,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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-16 11:42:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 158 transitions. [2022-11-16 11:42:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-16 11:42:26,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:26,978 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:26,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:42:26,978 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-16 11:42:26,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:26,979 INFO L85 PathProgramCache]: Analyzing trace with hash 425746828, now seen corresponding path program 1 times [2022-11-16 11:42:26,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:26,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906001902] [2022-11-16 11:42:26,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:26,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-16 11:42:27,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:27,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906001902] [2022-11-16 11:42:27,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906001902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:27,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:27,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:42:27,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467625727] [2022-11-16 11:42:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:27,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:42:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:27,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:42:27,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:42:27,253 INFO L87 Difference]: Start difference. First operand 141 states and 158 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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-16 11:42:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:27,424 INFO L93 Difference]: Finished difference Result 147 states and 162 transitions. [2022-11-16 11:42:27,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:42:27,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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 69 [2022-11-16 11:42:27,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:27,427 INFO L225 Difference]: With dead ends: 147 [2022-11-16 11:42:27,427 INFO L226 Difference]: Without dead ends: 147 [2022-11-16 11:42:27,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:42:27,428 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 333 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:27,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 102 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:42:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-16 11:42:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 141. [2022-11-16 11:42:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 126 states have (on average 1.246031746031746) internal successors, (157), 140 states have internal predecessors, (157), 0 states have call successors, (0), 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-16 11:42:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 157 transitions. [2022-11-16 11:42:27,433 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 157 transitions. Word has length 69 [2022-11-16 11:42:27,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:27,434 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 157 transitions. [2022-11-16 11:42:27,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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-16 11:42:27,434 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 157 transitions. [2022-11-16 11:42:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 11:42:27,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:27,439 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:27,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:42:27,440 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-16 11:42:27,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:27,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1414013856, now seen corresponding path program 1 times [2022-11-16 11:42:27,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:27,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579605489] [2022-11-16 11:42:27,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:27,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 68 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-16 11:42:28,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:28,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579605489] [2022-11-16 11:42:28,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579605489] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:42:28,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874040983] [2022-11-16 11:42:28,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:28,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:28,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:28,626 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:42:28,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:42:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:28,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 11:42:28,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:42:28,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:42:29,014 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:42:29,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:42:29,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:42:29,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:29,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 11:42:29,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:29,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:29,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-16 11:42:29,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:29,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:29,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-16 11:42:29,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:29,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:29,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-16 11:42:29,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-16 11:42:29,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:42:29,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 11:42:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 72 proven. 12 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-16 11:42:29,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:42:29,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1268) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-11-16 11:42:29,493 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1266 Int) (v_ArrVal_1268 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1266)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1268) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-11-16 11:42:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 3 not checked. [2022-11-16 11:42:29,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874040983] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:42:29,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:42:29,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 23 [2022-11-16 11:42:29,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915014272] [2022-11-16 11:42:29,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:42:29,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 11:42:29,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:29,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 11:42:29,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=364, Unknown=2, NotChecked=78, Total=506 [2022-11-16 11:42:29,655 INFO L87 Difference]: Start difference. First operand 141 states and 157 transitions. Second operand has 23 states, 23 states have (on average 3.782608695652174) internal successors, (87), 23 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:30,854 INFO L93 Difference]: Finished difference Result 172 states and 186 transitions. [2022-11-16 11:42:30,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 11:42:30,854 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.782608695652174) internal successors, (87), 23 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-11-16 11:42:30,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:30,855 INFO L225 Difference]: With dead ends: 172 [2022-11-16 11:42:30,855 INFO L226 Difference]: Without dead ends: 172 [2022-11-16 11:42:30,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 139 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=288, Invalid=978, Unknown=2, NotChecked=138, Total=1406 [2022-11-16 11:42:30,857 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 841 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:30,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 435 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 477 Invalid, 0 Unknown, 265 Unchecked, 0.5s Time] [2022-11-16 11:42:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-16 11:42:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 141. [2022-11-16 11:42:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 126 states have (on average 1.2380952380952381) internal successors, (156), 140 states have internal predecessors, (156), 0 states have call successors, (0), 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-16 11:42:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 156 transitions. [2022-11-16 11:42:30,862 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 156 transitions. Word has length 73 [2022-11-16 11:42:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:30,862 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 156 transitions. [2022-11-16 11:42:30,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.782608695652174) internal successors, (87), 23 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 156 transitions. [2022-11-16 11:42:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-16 11:42:30,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:30,864 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:30,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:42:31,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:31,068 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-16 11:42:31,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:31,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1010527675, now seen corresponding path program 1 times [2022-11-16 11:42:31,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:31,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344929119] [2022-11-16 11:42:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 60 proven. 40 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 11:42:32,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:32,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344929119] [2022-11-16 11:42:32,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344929119] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:42:32,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74162811] [2022-11-16 11:42:32,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:32,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:32,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:32,972 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:42:33,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:42:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:33,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 11:42:33,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:42:33,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:42:33,433 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:42:33,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:42:33,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:42:33,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 11:42:33,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 11:42:33,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 11:42:33,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:42:33,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:42:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 72 proven. 12 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-16 11:42:33,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:42:33,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1645 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1645)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1647) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2022-11-16 11:42:34,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:42:34,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 43 [2022-11-16 11:42:34,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-16 11:42:34,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:42:34,129 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 1 not checked. [2022-11-16 11:42:34,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74162811] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:42:34,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:42:34,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 24 [2022-11-16 11:42:34,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658921838] [2022-11-16 11:42:34,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:42:34,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 11:42:34,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:34,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 11:42:34,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=437, Unknown=7, NotChecked=42, Total=552 [2022-11-16 11:42:34,132 INFO L87 Difference]: Start difference. First operand 141 states and 156 transitions. Second operand has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 states have internal predecessors, (98), 0 states have call successors, (0), 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-16 11:42:35,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:35,137 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2022-11-16 11:42:35,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 11:42:35,138 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 states have internal predecessors, (98), 0 states have call successors, (0), 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 75 [2022-11-16 11:42:35,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:35,139 INFO L225 Difference]: With dead ends: 172 [2022-11-16 11:42:35,139 INFO L226 Difference]: Without dead ends: 172 [2022-11-16 11:42:35,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 148 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=328, Invalid=1229, Unknown=7, NotChecked=76, Total=1640 [2022-11-16 11:42:35,141 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 775 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:35,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 472 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 400 Invalid, 0 Unknown, 152 Unchecked, 0.4s Time] [2022-11-16 11:42:35,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-16 11:42:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 141. [2022-11-16 11:42:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 140 states have internal predecessors, (155), 0 states have call successors, (0), 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-16 11:42:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2022-11-16 11:42:35,145 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 75 [2022-11-16 11:42:35,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:35,145 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2022-11-16 11:42:35,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 states have internal predecessors, (98), 0 states have call successors, (0), 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-16 11:42:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2022-11-16 11:42:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-16 11:42:35,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:35,147 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:35,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:42:35,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:35,356 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-16 11:42:35,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:35,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1600170951, now seen corresponding path program 1 times [2022-11-16 11:42:35,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:35,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505486334] [2022-11-16 11:42:35,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:36,487 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 68 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-16 11:42:36,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:36,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505486334] [2022-11-16 11:42:36,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505486334] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:42:36,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071122907] [2022-11-16 11:42:36,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:36,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:36,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:36,490 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:42:36,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:42:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:36,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 11:42:36,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:42:36,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:42:36,989 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:42:36,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:42:37,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:42:37,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 11:42:37,195 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:42:37,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-16 11:42:37,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:42:37,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2022-11-16 11:42:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 72 proven. 12 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-16 11:42:37,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:42:38,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:42:38,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-11-16 11:42:38,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:42:38,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2022-11-16 11:42:38,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-16 11:42:38,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:42:38,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-16 11:42:38,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:42:38,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2022-11-16 11:42:38,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-16 11:42:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 72 proven. 12 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-16 11:42:38,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071122907] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:42:38,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:42:38,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2022-11-16 11:42:38,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424709973] [2022-11-16 11:42:38,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:42:38,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-16 11:42:38,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:38,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-16 11:42:38,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=903, Unknown=2, NotChecked=0, Total=992 [2022-11-16 11:42:38,549 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 32 states, 32 states have (on average 3.625) internal successors, (116), 32 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:40,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:40,218 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2022-11-16 11:42:40,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 11:42:40,219 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.625) internal successors, (116), 32 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-11-16 11:42:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:40,220 INFO L225 Difference]: With dead ends: 159 [2022-11-16 11:42:40,220 INFO L226 Difference]: Without dead ends: 155 [2022-11-16 11:42:40,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=402, Invalid=1948, Unknown=2, NotChecked=0, Total=2352 [2022-11-16 11:42:40,223 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 1102 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:40,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 605 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 634 Invalid, 0 Unknown, 143 Unchecked, 0.7s Time] [2022-11-16 11:42:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-16 11:42:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 127. [2022-11-16 11:42:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 126 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-11-16 11:42:40,228 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 76 [2022-11-16 11:42:40,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:40,229 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-11-16 11:42:40,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.625) internal successors, (116), 32 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-11-16 11:42:40,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 11:42:40,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:40,234 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:40,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:42:40,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:40,436 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-16 11:42:40,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash -452909686, now seen corresponding path program 1 times [2022-11-16 11:42:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:40,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964246077] [2022-11-16 11:42:40,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:40,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:42:40,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:42:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:42:40,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:42:40,659 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:42:40,660 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (34 of 35 remaining) [2022-11-16 11:42:40,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 35 remaining) [2022-11-16 11:42:40,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 35 remaining) [2022-11-16 11:42:40,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 35 remaining) [2022-11-16 11:42:40,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 35 remaining) [2022-11-16 11:42:40,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 35 remaining) [2022-11-16 11:42:40,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 35 remaining) [2022-11-16 11:42:40,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 35 remaining) [2022-11-16 11:42:40,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 35 remaining) [2022-11-16 11:42:40,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 35 remaining) [2022-11-16 11:42:40,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 35 remaining) [2022-11-16 11:42:40,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 35 remaining) [2022-11-16 11:42:40,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 35 remaining) [2022-11-16 11:42:40,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 35 remaining) [2022-11-16 11:42:40,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 35 remaining) [2022-11-16 11:42:40,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 35 remaining) [2022-11-16 11:42:40,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 35 remaining) [2022-11-16 11:42:40,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 35 remaining) [2022-11-16 11:42:40,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 35 remaining) [2022-11-16 11:42:40,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 35 remaining) [2022-11-16 11:42:40,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 35 remaining) [2022-11-16 11:42:40,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 35 remaining) [2022-11-16 11:42:40,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 35 remaining) [2022-11-16 11:42:40,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 35 remaining) [2022-11-16 11:42:40,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 35 remaining) [2022-11-16 11:42:40,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 35 remaining) [2022-11-16 11:42:40,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 35 remaining) [2022-11-16 11:42:40,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 35 remaining) [2022-11-16 11:42:40,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 35 remaining) [2022-11-16 11:42:40,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 35 remaining) [2022-11-16 11:42:40,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 35 remaining) [2022-11-16 11:42:40,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE (3 of 35 remaining) [2022-11-16 11:42:40,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (2 of 35 remaining) [2022-11-16 11:42:40,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (1 of 35 remaining) [2022-11-16 11:42:40,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (0 of 35 remaining) [2022-11-16 11:42:40,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:42:40,674 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:40,679 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:42:40,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:42:40 BoogieIcfgContainer [2022-11-16 11:42:40,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:42:40,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:42:40,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:42:40,753 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:42:40,754 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:42:20" (3/4) ... [2022-11-16 11:42:40,756 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:42:40,821 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:42:40,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:42:40,822 INFO L158 Benchmark]: Toolchain (without parser) took 22203.68ms. Allocated memory was 123.7MB in the beginning and 325.1MB in the end (delta: 201.3MB). Free memory was 81.1MB in the beginning and 158.9MB in the end (delta: -77.8MB). Peak memory consumption was 122.3MB. Max. memory is 16.1GB. [2022-11-16 11:42:40,822 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 123.7MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:42:40,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 712.67ms. Allocated memory is still 123.7MB. Free memory was 80.9MB in the beginning and 90.9MB in the end (delta: -10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:42:40,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.82ms. Allocated memory is still 123.7MB. Free memory was 90.9MB in the beginning and 88.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:42:40,823 INFO L158 Benchmark]: Boogie Preprocessor took 79.98ms. Allocated memory is still 123.7MB. Free memory was 88.8MB in the beginning and 87.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:42:40,824 INFO L158 Benchmark]: RCFGBuilder took 749.39ms. Allocated memory is still 123.7MB. Free memory was 87.3MB in the beginning and 68.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-16 11:42:40,824 INFO L158 Benchmark]: TraceAbstraction took 20495.94ms. Allocated memory was 123.7MB in the beginning and 325.1MB in the end (delta: 201.3MB). Free memory was 67.9MB in the beginning and 163.1MB in the end (delta: -95.2MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. [2022-11-16 11:42:40,824 INFO L158 Benchmark]: Witness Printer took 68.24ms. Allocated memory is still 325.1MB. Free memory was 163.1MB in the beginning and 158.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:42:40,826 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.89ms. Allocated memory is still 123.7MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 712.67ms. Allocated memory is still 123.7MB. Free memory was 80.9MB in the beginning and 90.9MB in the end (delta: -10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.82ms. Allocated memory is still 123.7MB. Free memory was 90.9MB in the beginning and 88.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.98ms. Allocated memory is still 123.7MB. Free memory was 88.8MB in the beginning and 87.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 749.39ms. Allocated memory is still 123.7MB. Free memory was 87.3MB in the beginning and 68.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 20495.94ms. Allocated memory was 123.7MB in the beginning and 325.1MB in the end (delta: 201.3MB). Free memory was 67.9MB in the beginning and 163.1MB in the end (delta: -95.2MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. * Witness Printer took 68.24ms. Allocated memory is still 325.1MB. Free memory was 163.1MB in the beginning and 158.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 616]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L599] const int len = 5; [L600] CALL, EXPR dll_create(len) [L579] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=0, head={0:0}, len=5, new_head={-1:0}] [L588] new_head->next = head VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L590] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-1:0}, len=4, new_head={-1:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=0, head={-1:0}, len=4, new_head={-2:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-2:0}, len=3, new_head={-2:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=0, head={-2:0}, len=3, new_head={-3:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-3:0}, len=2, new_head={-3:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=0, head={-3:0}, len=2, new_head={-4:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-4:0}, len=1, new_head={-4:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, head={-4:0}, len=1, new_head={-5:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-5:0}, len=0, new_head={-5:0}] [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={-5:0}, len=0, new_head={-5:0}] [L596] return head; VAL [\old(len)=5, \result={-5:0}, head={-5:0}, len=0, new_head={-5:0}] [L600] RET, EXPR dll_create(len) [L600] DLL head = dll_create(len); [L601] head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L601] COND TRUE head->next [L602] EXPR head->data_0 VAL [head={-5:0}, head->data_0=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, len=5] [L602] EXPR head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] reach_error() VAL [head={-5:0}, len=5] - 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: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: 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 1 procedures, 87 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4489 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4489 mSDsluCounter, 2971 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 596 IncrementalHoareTripleChecker+Unchecked, 2108 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2187 IncrementalHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 863 mSDtfsCounter, 2187 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 796 GetRequests, 606 SyntacticMatches, 15 SemanticMatches, 175 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=9, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 291 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 887 NumberOfCodeBlocks, 887 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1100 ConstructedInterpolants, 40 QuantifiedInterpolants, 5456 SizeOfPredicates, 49 NumberOfNonLiveVariables, 2827 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 25 InterpolantComputations, 7 PerfectInterpolantSequences, 1264/1575 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-16 11:42:40,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2a03009-1c92-4e24-a6c7-92a37856b9a5/bin/uautomizer-tPACEb0tL8/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)