./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:03:22,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:03:22,451 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 22:03:22,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:03:22,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 22:03:22,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:03:22,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 22:03:22,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 22:03:22,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 22:03:22,491 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 22:03:22,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:03:22,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 22:03:22,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:03:22,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:03:22,494 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 22:03:22,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:03:22,496 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:03:22,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:03:22,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:03:22,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:03:22,498 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 22:03:22,499 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 22:03:22,500 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 22:03:22,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:03:22,501 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 22:03:22,502 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 22:03:22,502 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:03:22,503 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:03:22,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:03:22,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 22:03:22,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 22:03:22,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 22:03:22,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:03:22,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:03:22,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:03:22,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 22:03:22,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 22:03:22,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 22:03:22,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 22:03:22,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 22:03:22,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 22:03:22,510 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/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_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2023-11-24 22:03:22,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:03:22,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:03:22,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:03:22,906 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:03:22,910 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:03:22,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2023-11-24 22:03:26,425 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:03:26,761 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:03:26,762 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2023-11-24 22:03:26,789 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/data/5d60b721f/cfef8a1fb1b94fc5855c6045a06e2af4/FLAG92589e8c1 [2023-11-24 22:03:26,813 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/data/5d60b721f/cfef8a1fb1b94fc5855c6045a06e2af4 [2023-11-24 22:03:26,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:03:26,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:03:26,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:03:26,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:03:26,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:03:26,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:03:26" (1/1) ... [2023-11-24 22:03:26,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba98a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:26, skipping insertion in model container [2023-11-24 22:03:26,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:03:26" (1/1) ... [2023-11-24 22:03:26,908 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:03:27,287 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:03:27,301 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:03:27,360 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:03:27,402 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:03:27,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:27 WrapperNode [2023-11-24 22:03:27,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:03:27,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:03:27,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:03:27,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:03:27,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:27" (1/1) ... [2023-11-24 22:03:27,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:27" (1/1) ... [2023-11-24 22:03:27,497 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2023-11-24 22:03:27,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:03:27,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:03:27,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:03:27,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:03:27,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:27" (1/1) ... [2023-11-24 22:03:27,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:27" (1/1) ... [2023-11-24 22:03:27,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:27" (1/1) ... [2023-11-24 22:03:27,583 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2023-11-24 22:03:27,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:27" (1/1) ... [2023-11-24 22:03:27,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:27" (1/1) ... [2023-11-24 22:03:27,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:27" (1/1) ... [2023-11-24 22:03:27,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:27" (1/1) ... [2023-11-24 22:03:27,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:27" (1/1) ... [2023-11-24 22:03:27,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:27" (1/1) ... [2023-11-24 22:03:27,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:03:27,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:03:27,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:03:27,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:03:27,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:27" (1/1) ... [2023-11-24 22:03:27,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:03:27,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:03:27,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 22:03:27,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 22:03:27,745 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-24 22:03:27,745 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-24 22:03:27,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-24 22:03:27,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-24 22:03:27,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 22:03:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 22:03:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 22:03:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:03:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-24 22:03:27,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-24 22:03:27,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-24 22:03:27,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-24 22:03:27,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 22:03:27,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 22:03:27,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 22:03:27,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:03:27,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:03:27,905 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:03:27,907 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:03:28,447 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:03:28,510 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:03:28,510 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-24 22:03:28,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:28 BoogieIcfgContainer [2023-11-24 22:03:28,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:03:28,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 22:03:28,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 22:03:28,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 22:03:28,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:03:26" (1/3) ... [2023-11-24 22:03:28,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a77d2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:03:28, skipping insertion in model container [2023-11-24 22:03:28,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:27" (2/3) ... [2023-11-24 22:03:28,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a77d2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:03:28, skipping insertion in model container [2023-11-24 22:03:28,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:28" (3/3) ... [2023-11-24 22:03:28,520 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2023-11-24 22:03:28,554 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 22:03:28,555 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2023-11-24 22:03:28,607 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 22:03:28,614 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@643c8386, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 22:03:28,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-11-24 22:03:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 53 states have (on average 2.358490566037736) internal successors, (125), 106 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 22:03:28,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-24 22:03:28,625 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:28,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-24 22:03:28,626 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:28,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:28,632 INFO L85 PathProgramCache]: Analyzing trace with hash 8135, now seen corresponding path program 1 times [2023-11-24 22:03:28,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:28,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908878055] [2023-11-24 22:03:28,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:28,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:28,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:28,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908878055] [2023-11-24 22:03:28,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908878055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:28,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:28,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:28,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106912996] [2023-11-24 22:03:28,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:28,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:29,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:29,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:29,029 INFO L87 Difference]: Start difference. First operand has 111 states, 53 states have (on average 2.358490566037736) internal successors, (125), 106 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-24 22:03:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:29,263 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2023-11-24 22:03:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:29,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-24 22:03:29,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:29,278 INFO L225 Difference]: With dead ends: 106 [2023-11-24 22:03:29,278 INFO L226 Difference]: Without dead ends: 105 [2023-11-24 22:03:29,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:29,288 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 86 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:29,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 61 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 22:03:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-24 22:03:29,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2023-11-24 22:03:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2023-11-24 22:03:29,354 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 2 [2023-11-24 22:03:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:29,355 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2023-11-24 22:03:29,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-24 22:03:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2023-11-24 22:03:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-24 22:03:29,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:29,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-24 22:03:29,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 22:03:29,360 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:29,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:29,361 INFO L85 PathProgramCache]: Analyzing trace with hash 8136, now seen corresponding path program 1 times [2023-11-24 22:03:29,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:29,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260256104] [2023-11-24 22:03:29,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:29,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:29,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:29,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260256104] [2023-11-24 22:03:29,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260256104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:29,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:29,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:29,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363157913] [2023-11-24 22:03:29,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:29,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:29,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:29,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:29,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:29,567 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-24 22:03:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:29,754 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2023-11-24 22:03:29,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:29,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-24 22:03:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:29,761 INFO L225 Difference]: With dead ends: 116 [2023-11-24 22:03:29,762 INFO L226 Difference]: Without dead ends: 116 [2023-11-24 22:03:29,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:29,769 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 82 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:29,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 67 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 22:03:29,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-24 22:03:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 104. [2023-11-24 22:03:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 102 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2023-11-24 22:03:29,798 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 2 [2023-11-24 22:03:29,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:29,799 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2023-11-24 22:03:29,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-24 22:03:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2023-11-24 22:03:29,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-24 22:03:29,800 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:29,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-24 22:03:29,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 22:03:29,801 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:29,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:29,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1071020683, now seen corresponding path program 1 times [2023-11-24 22:03:29,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:29,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392934367] [2023-11-24 22:03:29,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:29,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:30,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:30,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392934367] [2023-11-24 22:03:30,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392934367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:30,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:30,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:03:30,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355848116] [2023-11-24 22:03:30,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:30,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:03:30,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:30,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:03:30,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:03:30,054 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 4 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) [2023-11-24 22:03:30,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:30,306 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2023-11-24 22:03:30,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:30,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 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 [2023-11-24 22:03:30,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:30,313 INFO L225 Difference]: With dead ends: 109 [2023-11-24 22:03:30,315 INFO L226 Difference]: Without dead ends: 109 [2023-11-24 22:03:30,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:30,323 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 132 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:30,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 53 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 22:03:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-24 22:03:30,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2023-11-24 22:03:30,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.7796610169491525) internal successors, (105), 94 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2023-11-24 22:03:30,348 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 6 [2023-11-24 22:03:30,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:30,349 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2023-11-24 22:03:30,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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) [2023-11-24 22:03:30,350 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2023-11-24 22:03:30,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-24 22:03:30,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:30,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-24 22:03:30,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 22:03:30,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:30,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:30,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1071020682, now seen corresponding path program 1 times [2023-11-24 22:03:30,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:30,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446473928] [2023-11-24 22:03:30,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:30,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:30,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:30,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446473928] [2023-11-24 22:03:30,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446473928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:30,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:30,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:03:30,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782259562] [2023-11-24 22:03:30,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:30,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:03:30,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:30,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:03:30,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:03:30,675 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 4 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) [2023-11-24 22:03:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:30,951 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2023-11-24 22:03:30,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:03:30,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 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 [2023-11-24 22:03:30,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:30,953 INFO L225 Difference]: With dead ends: 127 [2023-11-24 22:03:30,953 INFO L226 Difference]: Without dead ends: 127 [2023-11-24 22:03:30,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:30,955 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 120 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:30,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 75 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 22:03:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-24 22:03:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2023-11-24 22:03:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.681159420289855) internal successors, (116), 103 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:30,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2023-11-24 22:03:30,965 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 6 [2023-11-24 22:03:30,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:30,966 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2023-11-24 22:03:30,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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) [2023-11-24 22:03:30,966 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2023-11-24 22:03:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-24 22:03:30,967 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:30,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:30,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 22:03:30,968 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:30,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1541477145, now seen corresponding path program 1 times [2023-11-24 22:03:30,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:30,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940130058] [2023-11-24 22:03:30,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:30,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:31,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:31,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:31,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940130058] [2023-11-24 22:03:31,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940130058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:31,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:31,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:31,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568965369] [2023-11-24 22:03:31,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:31,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:31,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:31,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:31,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:31,090 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:31,305 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2023-11-24 22:03:31,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:31,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-24 22:03:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:31,307 INFO L225 Difference]: With dead ends: 113 [2023-11-24 22:03:31,307 INFO L226 Difference]: Without dead ends: 113 [2023-11-24 22:03:31,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-24 22:03:31,309 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 45 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:31,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 149 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 22:03:31,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-24 22:03:31,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2023-11-24 22:03:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.6666666666666667) internal successors, (115), 102 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2023-11-24 22:03:31,319 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 8 [2023-11-24 22:03:31,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:31,319 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2023-11-24 22:03:31,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:31,319 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2023-11-24 22:03:31,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-24 22:03:31,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:31,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:31,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 22:03:31,321 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:31,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:31,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1541477146, now seen corresponding path program 1 times [2023-11-24 22:03:31,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:31,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611120301] [2023-11-24 22:03:31,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:31,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:31,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:31,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611120301] [2023-11-24 22:03:31,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611120301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:31,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:31,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:31,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927361914] [2023-11-24 22:03:31,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:31,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:31,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:31,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:31,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:31,574 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:31,825 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2023-11-24 22:03:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 22:03:31,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-24 22:03:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:31,836 INFO L225 Difference]: With dead ends: 104 [2023-11-24 22:03:31,837 INFO L226 Difference]: Without dead ends: 104 [2023-11-24 22:03:31,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-24 22:03:31,839 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 10 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:31,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 193 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 22:03:31,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-24 22:03:31,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2023-11-24 22:03:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.5942028985507246) internal successors, (110), 97 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2023-11-24 22:03:31,862 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 8 [2023-11-24 22:03:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:31,862 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2023-11-24 22:03:31,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2023-11-24 22:03:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-24 22:03:31,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:31,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:31,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 22:03:31,865 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:31,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:31,867 INFO L85 PathProgramCache]: Analyzing trace with hash -615643891, now seen corresponding path program 1 times [2023-11-24 22:03:31,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:31,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132393700] [2023-11-24 22:03:31,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:31,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:31,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:31,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132393700] [2023-11-24 22:03:31,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132393700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:31,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:31,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:03:31,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201175769] [2023-11-24 22:03:31,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:31,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:03:31,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:31,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:03:31,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:03:31,960 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:32,112 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2023-11-24 22:03:32,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:03:32,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-24 22:03:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:32,114 INFO L225 Difference]: With dead ends: 113 [2023-11-24 22:03:32,115 INFO L226 Difference]: Without dead ends: 113 [2023-11-24 22:03:32,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:32,119 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 91 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:32,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 103 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 22:03:32,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-24 22:03:32,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2023-11-24 22:03:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 96 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2023-11-24 22:03:32,145 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 10 [2023-11-24 22:03:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:32,146 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2023-11-24 22:03:32,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2023-11-24 22:03:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 22:03:32,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:32,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:32,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 22:03:32,150 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:32,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:32,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1281614861, now seen corresponding path program 1 times [2023-11-24 22:03:32,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:32,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682593034] [2023-11-24 22:03:32,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:32,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:32,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:32,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682593034] [2023-11-24 22:03:32,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682593034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:32,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:32,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:03:32,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646429645] [2023-11-24 22:03:32,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:32,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:03:32,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:32,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:03:32,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:03:32,394 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:32,614 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2023-11-24 22:03:32,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 22:03:32,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-24 22:03:32,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:32,616 INFO L225 Difference]: With dead ends: 151 [2023-11-24 22:03:32,616 INFO L226 Difference]: Without dead ends: 151 [2023-11-24 22:03:32,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-24 22:03:32,618 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 185 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:32,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 171 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 22:03:32,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-24 22:03:32,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2023-11-24 22:03:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.513157894736842) internal successors, (115), 103 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2023-11-24 22:03:32,624 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 13 [2023-11-24 22:03:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:32,624 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2023-11-24 22:03:32,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2023-11-24 22:03:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 22:03:32,626 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:32,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:32,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 22:03:32,627 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:32,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1074885830, now seen corresponding path program 1 times [2023-11-24 22:03:32,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:32,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730394318] [2023-11-24 22:03:32,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:32,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:32,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:32,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730394318] [2023-11-24 22:03:32,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730394318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:32,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:32,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375621164] [2023-11-24 22:03:32,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:32,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:32,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:32,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:32,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:32,816 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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) [2023-11-24 22:03:32,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:32,965 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2023-11-24 22:03:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:32,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 [2023-11-24 22:03:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:32,967 INFO L225 Difference]: With dead ends: 105 [2023-11-24 22:03:32,967 INFO L226 Difference]: Without dead ends: 105 [2023-11-24 22:03:32,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-24 22:03:32,968 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 31 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:32,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 143 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 22:03:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-24 22:03:32,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2023-11-24 22:03:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.5) internal successors, (114), 102 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2023-11-24 22:03:32,973 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 13 [2023-11-24 22:03:32,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:32,973 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2023-11-24 22:03:32,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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) [2023-11-24 22:03:32,974 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2023-11-24 22:03:32,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 22:03:32,974 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:32,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:32,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 22:03:32,975 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:32,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:32,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1074885829, now seen corresponding path program 1 times [2023-11-24 22:03:32,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:32,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557124779] [2023-11-24 22:03:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:32,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:33,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:33,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557124779] [2023-11-24 22:03:33,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557124779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:33,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:33,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:33,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418077636] [2023-11-24 22:03:33,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:33,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:33,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:33,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:33,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:33,188 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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) [2023-11-24 22:03:33,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:33,328 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2023-11-24 22:03:33,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:33,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 [2023-11-24 22:03:33,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:33,330 INFO L225 Difference]: With dead ends: 101 [2023-11-24 22:03:33,330 INFO L226 Difference]: Without dead ends: 101 [2023-11-24 22:03:33,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:33,331 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 5 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:33,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 22:03:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-24 22:03:33,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2023-11-24 22:03:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 94 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:33,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2023-11-24 22:03:33,335 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 13 [2023-11-24 22:03:33,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:33,335 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2023-11-24 22:03:33,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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) [2023-11-24 22:03:33,336 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2023-11-24 22:03:33,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-24 22:03:33,336 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:33,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:33,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 22:03:33,337 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:33,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:33,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2065078586, now seen corresponding path program 1 times [2023-11-24 22:03:33,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:33,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222377947] [2023-11-24 22:03:33,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:33,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:33,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:33,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222377947] [2023-11-24 22:03:33,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222377947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:33,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:33,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:03:33,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416937697] [2023-11-24 22:03:33,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:33,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:33,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:33,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:33,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:33,392 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2023-11-24 22:03:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:33,526 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2023-11-24 22:03:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:33,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2023-11-24 22:03:33,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:33,528 INFO L225 Difference]: With dead ends: 96 [2023-11-24 22:03:33,528 INFO L226 Difference]: Without dead ends: 96 [2023-11-24 22:03:33,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:03:33,529 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 9 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:33,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 180 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 22:03:33,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-24 22:03:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2023-11-24 22:03:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 93 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2023-11-24 22:03:33,532 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 16 [2023-11-24 22:03:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:33,532 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2023-11-24 22:03:33,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2023-11-24 22:03:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2023-11-24 22:03:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 22:03:33,533 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:33,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:33,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 22:03:33,533 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:33,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash -153465007, now seen corresponding path program 1 times [2023-11-24 22:03:33,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:33,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688563207] [2023-11-24 22:03:33,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:33,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:03:33,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 22:03:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:03:33,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 22:03:33,576 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 22:03:33,578 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2023-11-24 22:03:33,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2023-11-24 22:03:33,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2023-11-24 22:03:33,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2023-11-24 22:03:33,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2023-11-24 22:03:33,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2023-11-24 22:03:33,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2023-11-24 22:03:33,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2023-11-24 22:03:33,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2023-11-24 22:03:33,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2023-11-24 22:03:33,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2023-11-24 22:03:33,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2023-11-24 22:03:33,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2023-11-24 22:03:33,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2023-11-24 22:03:33,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2023-11-24 22:03:33,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2023-11-24 22:03:33,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2023-11-24 22:03:33,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2023-11-24 22:03:33,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2023-11-24 22:03:33,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2023-11-24 22:03:33,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2023-11-24 22:03:33,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2023-11-24 22:03:33,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2023-11-24 22:03:33,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2023-11-24 22:03:33,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2023-11-24 22:03:33,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2023-11-24 22:03:33,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2023-11-24 22:03:33,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2023-11-24 22:03:33,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2023-11-24 22:03:33,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2023-11-24 22:03:33,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2023-11-24 22:03:33,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 53 remaining) [2023-11-24 22:03:33,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 53 remaining) [2023-11-24 22:03:33,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 53 remaining) [2023-11-24 22:03:33,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 53 remaining) [2023-11-24 22:03:33,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2023-11-24 22:03:33,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2023-11-24 22:03:33,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2023-11-24 22:03:33,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2023-11-24 22:03:33,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (13 of 53 remaining) [2023-11-24 22:03:33,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (12 of 53 remaining) [2023-11-24 22:03:33,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (11 of 53 remaining) [2023-11-24 22:03:33,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2023-11-24 22:03:33,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2023-11-24 22:03:33,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (8 of 53 remaining) [2023-11-24 22:03:33,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (7 of 53 remaining) [2023-11-24 22:03:33,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (6 of 53 remaining) [2023-11-24 22:03:33,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2023-11-24 22:03:33,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2023-11-24 22:03:33,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (3 of 53 remaining) [2023-11-24 22:03:33,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (2 of 53 remaining) [2023-11-24 22:03:33,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (1 of 53 remaining) [2023-11-24 22:03:33,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (0 of 53 remaining) [2023-11-24 22:03:33,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 22:03:33,592 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:33,595 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 22:03:33,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 10:03:33 BoogieIcfgContainer [2023-11-24 22:03:33,615 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 22:03:33,615 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 22:03:33,615 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 22:03:33,615 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 22:03:33,616 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:28" (3/4) ... [2023-11-24 22:03:33,618 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 22:03:33,619 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 22:03:33,620 INFO L158 Benchmark]: Toolchain (without parser) took 6801.38ms. Allocated memory was 176.2MB in the beginning and 216.0MB in the end (delta: 39.8MB). Free memory was 129.9MB in the beginning and 82.1MB in the end (delta: 47.8MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2023-11-24 22:03:33,620 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 113.2MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:03:33,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.96ms. Allocated memory is still 176.2MB. Free memory was 129.9MB in the beginning and 112.0MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-24 22:03:33,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.24ms. Allocated memory is still 176.2MB. Free memory was 112.0MB in the beginning and 109.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 22:03:33,621 INFO L158 Benchmark]: Boogie Preprocessor took 146.48ms. Allocated memory is still 176.2MB. Free memory was 109.9MB in the beginning and 107.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 22:03:33,621 INFO L158 Benchmark]: RCFGBuilder took 864.87ms. Allocated memory is still 176.2MB. Free memory was 107.3MB in the beginning and 136.9MB in the end (delta: -29.6MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2023-11-24 22:03:33,622 INFO L158 Benchmark]: TraceAbstraction took 5101.19ms. Allocated memory was 176.2MB in the beginning and 216.0MB in the end (delta: 39.8MB). Free memory was 136.1MB in the beginning and 82.1MB in the end (delta: 54.0MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2023-11-24 22:03:33,622 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 216.0MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:03:33,624 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 113.2MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 582.96ms. Allocated memory is still 176.2MB. Free memory was 129.9MB in the beginning and 112.0MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.24ms. Allocated memory is still 176.2MB. Free memory was 112.0MB in the beginning and 109.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 146.48ms. Allocated memory is still 176.2MB. Free memory was 109.9MB in the beginning and 107.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 864.87ms. Allocated memory is still 176.2MB. Free memory was 107.3MB in the beginning and 136.9MB in the end (delta: -29.6MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5101.19ms. Allocated memory was 176.2MB in the beginning and 216.0MB in the end (delta: 39.8MB). Free memory was 136.1MB in the beginning and 82.1MB in the end (delta: 54.0MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 216.0MB. Free memory is still 82.1MB. There was no memory consumed. 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 - UnprovableResult [Line: 993]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 993. Possible FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={-1:0}, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1039] EXPR end->colour [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}] [L1043] EXPR end->colour [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next [L1049] COND TRUE !(end->next) [L1049] CALL reach_error() [L993] COND FALSE !(0) [L993] __assert_fail ("0", "sll-rb-cnstr_1-2.c", 13, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: 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 2 procedures, 111 locations, 53 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 796 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 796 mSDsluCounter, 1379 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 789 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1415 IncrementalHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 590 mSDtfsCounter, 1415 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=0, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 133 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2023-11-24 22:03:33,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:03:36,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:03:36,364 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 22:03:36,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:03:36,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 22:03:36,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:03:36,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 22:03:36,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 22:03:36,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 22:03:36,409 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 22:03:36,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:03:36,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 22:03:36,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:03:36,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:03:36,413 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 22:03:36,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:03:36,417 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:03:36,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:03:36,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:03:36,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:03:36,424 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 22:03:36,425 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 22:03:36,426 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 22:03:36,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:03:36,427 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 22:03:36,427 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 22:03:36,428 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 22:03:36,428 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 22:03:36,428 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:03:36,429 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:03:36,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:03:36,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 22:03:36,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 22:03:36,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 22:03:36,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:03:36,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:03:36,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:03:36,434 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 22:03:36,434 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 22:03:36,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 22:03:36,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 22:03:36,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 22:03:36,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 22:03:36,436 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 22:03:36,437 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/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_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2023-11-24 22:03:36,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:03:36,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:03:36,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:03:36,885 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:03:36,886 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:03:36,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2023-11-24 22:03:40,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:03:40,379 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:03:40,380 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2023-11-24 22:03:40,394 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/data/030aa8aaa/01775eae075c4d2e9618c30eeed91ac7/FLAGfdde7d1be [2023-11-24 22:03:40,408 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/data/030aa8aaa/01775eae075c4d2e9618c30eeed91ac7 [2023-11-24 22:03:40,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:03:40,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:03:40,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:03:40,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:03:40,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:03:40,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:03:40" (1/1) ... [2023-11-24 22:03:40,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@251e9567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:40, skipping insertion in model container [2023-11-24 22:03:40,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:03:40" (1/1) ... [2023-11-24 22:03:40,482 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:03:40,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:03:40,923 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:03:40,998 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:03:41,045 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:03:41,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:41 WrapperNode [2023-11-24 22:03:41,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:03:41,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:03:41,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:03:41,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:03:41,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:41" (1/1) ... [2023-11-24 22:03:41,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:41" (1/1) ... [2023-11-24 22:03:41,134 INFO L138 Inliner]: procedures = 122, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2023-11-24 22:03:41,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:03:41,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:03:41,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:03:41,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:03:41,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:41" (1/1) ... [2023-11-24 22:03:41,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:41" (1/1) ... [2023-11-24 22:03:41,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:41" (1/1) ... [2023-11-24 22:03:41,172 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2023-11-24 22:03:41,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:41" (1/1) ... [2023-11-24 22:03:41,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:41" (1/1) ... [2023-11-24 22:03:41,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:41" (1/1) ... [2023-11-24 22:03:41,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:41" (1/1) ... [2023-11-24 22:03:41,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:41" (1/1) ... [2023-11-24 22:03:41,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:41" (1/1) ... [2023-11-24 22:03:41,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:03:41,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:03:41,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:03:41,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:03:41,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:41" (1/1) ... [2023-11-24 22:03:41,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:03:41,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:03:41,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 22:03:41,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 22:03:41,308 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-24 22:03:41,308 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-24 22:03:41,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-24 22:03:41,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-24 22:03:41,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 22:03:41,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:03:41,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-24 22:03:41,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-24 22:03:41,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-24 22:03:41,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-24 22:03:41,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 22:03:41,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-24 22:03:41,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-24 22:03:41,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-24 22:03:41,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-24 22:03:41,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:03:41,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:03:41,485 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:03:41,487 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:03:42,173 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:03:42,247 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:03:42,248 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-24 22:03:42,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:42 BoogieIcfgContainer [2023-11-24 22:03:42,248 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:03:42,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 22:03:42,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 22:03:42,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 22:03:42,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:03:40" (1/3) ... [2023-11-24 22:03:42,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10664657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:03:42, skipping insertion in model container [2023-11-24 22:03:42,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:41" (2/3) ... [2023-11-24 22:03:42,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10664657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:03:42, skipping insertion in model container [2023-11-24 22:03:42,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:42" (3/3) ... [2023-11-24 22:03:42,258 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2023-11-24 22:03:42,278 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 22:03:42,279 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2023-11-24 22:03:42,338 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 22:03:42,346 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2619fea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 22:03:42,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-11-24 22:03:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 53 states have (on average 2.358490566037736) internal successors, (125), 106 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 22:03:42,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-24 22:03:42,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:42,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-24 22:03:42,359 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:42,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:42,367 INFO L85 PathProgramCache]: Analyzing trace with hash 8135, now seen corresponding path program 1 times [2023-11-24 22:03:42,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:42,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737976720] [2023-11-24 22:03:42,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:42,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:42,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:42,384 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:42,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-24 22:03:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:42,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:03:42,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:42,552 INFO L378 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 7 [2023-11-24 22:03:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:42,565 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:42,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:42,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737976720] [2023-11-24 22:03:42,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737976720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:42,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:42,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:42,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715015603] [2023-11-24 22:03:42,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:42,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:42,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:42,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:42,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:42,633 INFO L87 Difference]: Start difference. First operand has 111 states, 53 states have (on average 2.358490566037736) internal successors, (125), 106 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-24 22:03:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:42,940 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2023-11-24 22:03:42,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:42,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-24 22:03:42,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:42,953 INFO L225 Difference]: With dead ends: 106 [2023-11-24 22:03:42,953 INFO L226 Difference]: Without dead ends: 105 [2023-11-24 22:03:42,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:42,958 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 86 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:42,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 61 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 22:03:42,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-24 22:03:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2023-11-24 22:03:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2023-11-24 22:03:43,012 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 2 [2023-11-24 22:03:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:43,013 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2023-11-24 22:03:43,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-24 22:03:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2023-11-24 22:03:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-24 22:03:43,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:43,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-24 22:03:43,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:43,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:43,219 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:43,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:43,219 INFO L85 PathProgramCache]: Analyzing trace with hash 8136, now seen corresponding path program 1 times [2023-11-24 22:03:43,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:43,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85684269] [2023-11-24 22:03:43,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:43,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:43,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:43,222 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:43,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-24 22:03:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:43,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:03:43,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:43,313 INFO L378 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 [2023-11-24 22:03:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:43,331 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:43,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:43,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85684269] [2023-11-24 22:03:43,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85684269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:43,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:43,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:43,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219857735] [2023-11-24 22:03:43,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:43,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:43,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:43,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:43,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:43,335 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-24 22:03:43,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:43,694 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2023-11-24 22:03:43,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:43,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-24 22:03:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:43,697 INFO L225 Difference]: With dead ends: 116 [2023-11-24 22:03:43,697 INFO L226 Difference]: Without dead ends: 116 [2023-11-24 22:03:43,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:43,698 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 82 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:43,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 67 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 22:03:43,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-24 22:03:43,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 104. [2023-11-24 22:03:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 102 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2023-11-24 22:03:43,710 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 2 [2023-11-24 22:03:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:43,711 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2023-11-24 22:03:43,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-24 22:03:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2023-11-24 22:03:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-24 22:03:43,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:43,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-24 22:03:43,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:43,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:43,914 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:43,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:43,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1071020683, now seen corresponding path program 1 times [2023-11-24 22:03:43,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:43,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758059420] [2023-11-24 22:03:43,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:43,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:43,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:43,920 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:43,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-24 22:03:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:44,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 22:03:44,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:44,038 INFO L378 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 7 [2023-11-24 22:03:44,102 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-24 22:03:44,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-24 22:03:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:44,119 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:44,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:44,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758059420] [2023-11-24 22:03:44,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758059420] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:44,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:44,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:03:44,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822212032] [2023-11-24 22:03:44,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:44,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:03:44,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:44,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:03:44,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:03:44,123 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 4 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) [2023-11-24 22:03:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:44,502 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2023-11-24 22:03:44,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:44,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 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 [2023-11-24 22:03:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:44,504 INFO L225 Difference]: With dead ends: 109 [2023-11-24 22:03:44,504 INFO L226 Difference]: Without dead ends: 109 [2023-11-24 22:03:44,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:44,506 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 132 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:44,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 53 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 22:03:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-24 22:03:44,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2023-11-24 22:03:44,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.7796610169491525) internal successors, (105), 94 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:44,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2023-11-24 22:03:44,515 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 6 [2023-11-24 22:03:44,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:44,516 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2023-11-24 22:03:44,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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) [2023-11-24 22:03:44,516 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2023-11-24 22:03:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-24 22:03:44,517 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:44,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-24 22:03:44,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:44,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:44,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:44,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:44,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1071020682, now seen corresponding path program 1 times [2023-11-24 22:03:44,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:44,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226114679] [2023-11-24 22:03:44,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:44,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:44,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:44,723 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:44,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-24 22:03:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:44,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-24 22:03:44,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:44,830 INFO L378 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 [2023-11-24 22:03:44,924 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-24 22:03:44,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-24 22:03:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:44,942 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:44,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:44,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226114679] [2023-11-24 22:03:44,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226114679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:44,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:44,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:03:44,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606200613] [2023-11-24 22:03:44,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:44,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:03:44,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:44,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:03:44,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:03:44,948 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 4 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) [2023-11-24 22:03:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:45,435 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2023-11-24 22:03:45,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:03:45,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 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 [2023-11-24 22:03:45,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:45,437 INFO L225 Difference]: With dead ends: 127 [2023-11-24 22:03:45,437 INFO L226 Difference]: Without dead ends: 127 [2023-11-24 22:03:45,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:45,439 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 120 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:45,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 75 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 22:03:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-24 22:03:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2023-11-24 22:03:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.681159420289855) internal successors, (116), 103 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2023-11-24 22:03:45,449 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 6 [2023-11-24 22:03:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:45,449 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2023-11-24 22:03:45,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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) [2023-11-24 22:03:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2023-11-24 22:03:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-24 22:03:45,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:45,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:45,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:45,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:45,653 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:45,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:45,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1541477145, now seen corresponding path program 1 times [2023-11-24 22:03:45,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:45,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793212148] [2023-11-24 22:03:45,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:45,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:45,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:45,657 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:45,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-24 22:03:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:45,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-24 22:03:45,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:45,756 INFO L378 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 7 [2023-11-24 22:03:45,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 22:03:45,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-24 22:03:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:45,808 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:45,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:45,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793212148] [2023-11-24 22:03:45,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793212148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:45,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:45,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:45,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133281544] [2023-11-24 22:03:45,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:45,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:45,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:45,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:45,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:45,816 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:46,286 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2023-11-24 22:03:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:46,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-24 22:03:46,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:46,288 INFO L225 Difference]: With dead ends: 113 [2023-11-24 22:03:46,288 INFO L226 Difference]: Without dead ends: 113 [2023-11-24 22:03:46,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-24 22:03:46,290 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 45 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:46,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 149 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 22:03:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-24 22:03:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2023-11-24 22:03:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.6666666666666667) internal successors, (115), 102 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2023-11-24 22:03:46,299 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 8 [2023-11-24 22:03:46,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:46,300 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2023-11-24 22:03:46,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:46,300 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2023-11-24 22:03:46,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-24 22:03:46,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:46,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:46,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:46,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:46,521 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:46,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:46,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1541477146, now seen corresponding path program 1 times [2023-11-24 22:03:46,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:46,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561239149] [2023-11-24 22:03:46,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:46,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:46,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:46,524 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:46,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-24 22:03:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:46,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-24 22:03:46,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:46,641 INFO L378 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 [2023-11-24 22:03:46,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 22:03:46,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 22:03:46,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 22:03:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:46,731 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:46,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:46,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561239149] [2023-11-24 22:03:46,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561239149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:46,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:46,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:46,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297152566] [2023-11-24 22:03:46,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:46,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:46,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:46,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:46,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:46,735 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:47,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:47,267 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2023-11-24 22:03:47,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 22:03:47,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-24 22:03:47,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:47,268 INFO L225 Difference]: With dead ends: 104 [2023-11-24 22:03:47,269 INFO L226 Difference]: Without dead ends: 104 [2023-11-24 22:03:47,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-24 22:03:47,270 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 10 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:47,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 193 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 22:03:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-24 22:03:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2023-11-24 22:03:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.5942028985507246) internal successors, (110), 97 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2023-11-24 22:03:47,276 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 8 [2023-11-24 22:03:47,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:47,276 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2023-11-24 22:03:47,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2023-11-24 22:03:47,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-24 22:03:47,277 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:47,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:47,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-24 22:03:47,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:47,486 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:47,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:47,487 INFO L85 PathProgramCache]: Analyzing trace with hash -615643891, now seen corresponding path program 1 times [2023-11-24 22:03:47,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:47,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675197355] [2023-11-24 22:03:47,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:47,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:47,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:47,489 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:47,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-24 22:03:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:47,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:03:47,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:47,603 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:47,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:47,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675197355] [2023-11-24 22:03:47,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675197355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:47,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:47,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:03:47,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458966030] [2023-11-24 22:03:47,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:47,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:03:47,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:47,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:03:47,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:03:47,606 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:47,946 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2023-11-24 22:03:47,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:03:47,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-24 22:03:47,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:47,948 INFO L225 Difference]: With dead ends: 113 [2023-11-24 22:03:47,948 INFO L226 Difference]: Without dead ends: 113 [2023-11-24 22:03:47,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:47,949 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 91 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:47,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 103 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 22:03:47,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-24 22:03:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2023-11-24 22:03:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 96 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2023-11-24 22:03:47,957 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 10 [2023-11-24 22:03:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:47,957 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2023-11-24 22:03:47,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2023-11-24 22:03:47,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 22:03:47,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:47,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:47,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:48,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:48,164 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:48,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1281614861, now seen corresponding path program 1 times [2023-11-24 22:03:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:48,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811395528] [2023-11-24 22:03:48,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:48,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:48,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:48,167 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:48,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-24 22:03:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:48,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-24 22:03:48,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:48,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-24 22:03:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:48,340 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:48,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:48,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811395528] [2023-11-24 22:03:48,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811395528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:48,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:48,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:03:48,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366548938] [2023-11-24 22:03:48,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:48,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:48,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:48,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:48,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:48,346 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:48,890 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2023-11-24 22:03:48,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:03:48,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-24 22:03:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:48,892 INFO L225 Difference]: With dead ends: 151 [2023-11-24 22:03:48,892 INFO L226 Difference]: Without dead ends: 151 [2023-11-24 22:03:48,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-24 22:03:48,893 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 71 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:48,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 169 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 22:03:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-24 22:03:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2023-11-24 22:03:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.513157894736842) internal successors, (115), 103 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2023-11-24 22:03:48,899 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 13 [2023-11-24 22:03:48,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:48,899 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2023-11-24 22:03:48,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2023-11-24 22:03:48,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 22:03:48,900 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:48,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:48,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-24 22:03:49,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:49,103 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:49,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1074885830, now seen corresponding path program 1 times [2023-11-24 22:03:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:49,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954874433] [2023-11-24 22:03:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:49,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:49,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:49,108 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:49,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-24 22:03:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:49,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 22:03:49,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:49,255 INFO L378 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 7 [2023-11-24 22:03:49,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 22:03:49,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-24 22:03:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:49,309 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:49,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:49,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954874433] [2023-11-24 22:03:49,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954874433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:49,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:49,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:49,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108544209] [2023-11-24 22:03:49,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:49,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:49,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:49,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:49,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:49,311 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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) [2023-11-24 22:03:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:49,696 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2023-11-24 22:03:49,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:49,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 [2023-11-24 22:03:49,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:49,698 INFO L225 Difference]: With dead ends: 105 [2023-11-24 22:03:49,698 INFO L226 Difference]: Without dead ends: 105 [2023-11-24 22:03:49,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-24 22:03:49,699 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 31 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:49,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 143 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 22:03:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-24 22:03:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2023-11-24 22:03:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.5) internal successors, (114), 102 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2023-11-24 22:03:49,704 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 13 [2023-11-24 22:03:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:49,705 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2023-11-24 22:03:49,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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) [2023-11-24 22:03:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2023-11-24 22:03:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 22:03:49,706 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:49,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:49,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:49,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:49,909 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:49,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:49,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1074885829, now seen corresponding path program 1 times [2023-11-24 22:03:49,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:49,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641321683] [2023-11-24 22:03:49,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:49,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:49,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:49,912 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:49,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-24 22:03:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:50,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-24 22:03:50,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:50,026 INFO L378 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 [2023-11-24 22:03:50,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 22:03:50,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 22:03:50,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 22:03:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:50,102 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:50,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:50,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641321683] [2023-11-24 22:03:50,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641321683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:50,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:50,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:50,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387826089] [2023-11-24 22:03:50,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:50,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:50,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:50,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:50,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:50,105 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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) [2023-11-24 22:03:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:50,561 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2023-11-24 22:03:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:50,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 [2023-11-24 22:03:50,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:50,563 INFO L225 Difference]: With dead ends: 101 [2023-11-24 22:03:50,563 INFO L226 Difference]: Without dead ends: 101 [2023-11-24 22:03:50,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:50,564 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 5 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:50,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 22:03:50,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-24 22:03:50,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2023-11-24 22:03:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 94 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2023-11-24 22:03:50,569 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 13 [2023-11-24 22:03:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:50,569 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2023-11-24 22:03:50,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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) [2023-11-24 22:03:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2023-11-24 22:03:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-24 22:03:50,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:50,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:50,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:50,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:50,773 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:50,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:50,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2065078586, now seen corresponding path program 1 times [2023-11-24 22:03:50,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:50,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714234214] [2023-11-24 22:03:50,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:50,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:50,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:50,775 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:50,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-24 22:03:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:50,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-24 22:03:50,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:50,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-24 22:03:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:50,940 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:50,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:50,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714234214] [2023-11-24 22:03:50,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714234214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:50,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:50,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:03:50,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997821954] [2023-11-24 22:03:50,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:50,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:50,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:50,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:50,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:50,951 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2023-11-24 22:03:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:51,450 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2023-11-24 22:03:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:03:51,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2023-11-24 22:03:51,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:51,452 INFO L225 Difference]: With dead ends: 141 [2023-11-24 22:03:51,452 INFO L226 Difference]: Without dead ends: 141 [2023-11-24 22:03:51,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-24 22:03:51,453 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 62 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:51,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 160 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 22:03:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-24 22:03:51,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 100. [2023-11-24 22:03:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 98 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2023-11-24 22:03:51,458 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 16 [2023-11-24 22:03:51,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:51,458 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2023-11-24 22:03:51,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2023-11-24 22:03:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2023-11-24 22:03:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 22:03:51,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:51,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:51,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:51,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:51,662 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 22:03:51,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:51,662 INFO L85 PathProgramCache]: Analyzing trace with hash -153465007, now seen corresponding path program 1 times [2023-11-24 22:03:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:51,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611972412] [2023-11-24 22:03:51,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:51,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:51,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:51,664 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:51,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-24 22:03:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:03:51,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 22:03:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:03:51,813 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-24 22:03:51,813 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 22:03:51,814 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2023-11-24 22:03:51,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2023-11-24 22:03:51,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2023-11-24 22:03:51,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2023-11-24 22:03:51,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2023-11-24 22:03:51,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2023-11-24 22:03:51,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2023-11-24 22:03:51,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2023-11-24 22:03:51,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2023-11-24 22:03:51,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2023-11-24 22:03:51,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2023-11-24 22:03:51,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2023-11-24 22:03:51,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2023-11-24 22:03:51,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2023-11-24 22:03:51,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2023-11-24 22:03:51,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2023-11-24 22:03:51,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2023-11-24 22:03:51,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2023-11-24 22:03:51,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2023-11-24 22:03:51,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2023-11-24 22:03:51,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2023-11-24 22:03:51,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2023-11-24 22:03:51,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2023-11-24 22:03:51,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2023-11-24 22:03:51,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2023-11-24 22:03:51,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2023-11-24 22:03:51,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2023-11-24 22:03:51,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2023-11-24 22:03:51,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2023-11-24 22:03:51,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2023-11-24 22:03:51,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2023-11-24 22:03:51,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 53 remaining) [2023-11-24 22:03:51,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 53 remaining) [2023-11-24 22:03:51,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 53 remaining) [2023-11-24 22:03:51,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 53 remaining) [2023-11-24 22:03:51,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2023-11-24 22:03:51,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2023-11-24 22:03:51,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2023-11-24 22:03:51,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2023-11-24 22:03:51,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (13 of 53 remaining) [2023-11-24 22:03:51,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (12 of 53 remaining) [2023-11-24 22:03:51,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (11 of 53 remaining) [2023-11-24 22:03:51,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2023-11-24 22:03:51,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2023-11-24 22:03:51,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (8 of 53 remaining) [2023-11-24 22:03:51,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (7 of 53 remaining) [2023-11-24 22:03:51,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (6 of 53 remaining) [2023-11-24 22:03:51,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2023-11-24 22:03:51,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2023-11-24 22:03:51,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (3 of 53 remaining) [2023-11-24 22:03:51,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (2 of 53 remaining) [2023-11-24 22:03:51,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (1 of 53 remaining) [2023-11-24 22:03:51,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (0 of 53 remaining) [2023-11-24 22:03:51,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:52,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:52,043 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:52,047 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 22:03:52,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 10:03:52 BoogieIcfgContainer [2023-11-24 22:03:52,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 22:03:52,076 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 22:03:52,076 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 22:03:52,076 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 22:03:52,077 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:42" (3/4) ... [2023-11-24 22:03:52,079 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 22:03:52,080 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 22:03:52,081 INFO L158 Benchmark]: Toolchain (without parser) took 11669.04ms. Allocated memory was 69.2MB in the beginning and 113.2MB in the end (delta: 44.0MB). Free memory was 44.1MB in the beginning and 62.6MB in the end (delta: -18.5MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2023-11-24 22:03:52,081 INFO L158 Benchmark]: CDTParser took 1.34ms. Allocated memory is still 69.2MB. Free memory was 45.2MB in the beginning and 45.1MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:03:52,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 633.25ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 43.8MB in the beginning and 65.8MB in the end (delta: -22.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2023-11-24 22:03:52,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.42ms. Allocated memory is still 94.4MB. Free memory was 65.7MB in the beginning and 63.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 22:03:52,090 INFO L158 Benchmark]: Boogie Preprocessor took 64.04ms. Allocated memory is still 94.4MB. Free memory was 63.2MB in the beginning and 60.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 22:03:52,091 INFO L158 Benchmark]: RCFGBuilder took 1048.16ms. Allocated memory is still 94.4MB. Free memory was 60.3MB in the beginning and 56.1MB in the end (delta: 4.2MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2023-11-24 22:03:52,092 INFO L158 Benchmark]: TraceAbstraction took 9824.47ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 55.6MB in the beginning and 62.6MB in the end (delta: -7.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2023-11-24 22:03:52,092 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 113.2MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:03:52,094 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34ms. Allocated memory is still 69.2MB. Free memory was 45.2MB in the beginning and 45.1MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 633.25ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 43.8MB in the beginning and 65.8MB in the end (delta: -22.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.42ms. Allocated memory is still 94.4MB. Free memory was 65.7MB in the beginning and 63.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.04ms. Allocated memory is still 94.4MB. Free memory was 63.2MB in the beginning and 60.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1048.16ms. Allocated memory is still 94.4MB. Free memory was 60.3MB in the beginning and 56.1MB in the end (delta: 4.2MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9824.47ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 55.6MB in the beginning and 62.6MB in the end (delta: -7.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 113.2MB. Free memory is still 62.6MB. There was no memory consumed. 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 - UnprovableResult [Line: 993]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 993. Possible FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={6:0}, list={6:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={6:0}, list={6:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={6:0}, list={6:0}] [L1039] EXPR end->colour [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end VAL [end={6:0}, list={6:0}] [L1043] EXPR end->colour [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next [L1049] COND TRUE !(end->next) [L1049] CALL reach_error() [L993] COND FALSE !(0) [L993] __assert_fail ("0", "sll-rb-cnstr_1-2.c", 13, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: 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 2 procedures, 111 locations, 53 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 735 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 735 mSDsluCounter, 1357 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 777 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1431 IncrementalHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 580 mSDtfsCounter, 1431 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=0, InterpolantAutomatonStates: 53, 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, 11 MinimizatonAttempts, 173 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 428 SizeOfPredicates, 22 NumberOfNonLiveVariables, 779 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2023-11-24 22:03:52,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081096c1-977f-4bae-a19d-f252b3054153/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample