./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:15:01,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:15:01,117 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 04:15:01,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:15:01,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:15:01,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:15:01,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:15:01,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:15:01,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:15:01,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:15:01,170 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:15:01,170 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:15:01,170 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:15:01,170 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:15:01,170 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:15:01,171 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:15:01,171 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:15:01,171 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:15:01,171 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:15:01,171 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:15:01,171 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:15:01,171 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:15:01,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 04:15:01,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 04:15:01,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:15:01,172 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:15:01,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:15:01,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:15:01,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:15:01,173 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 04:15:01,173 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 04:15:01,173 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 04:15:01,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:15:01,174 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:15:01,174 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:15:01,174 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 04:15:01,174 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:15:01,175 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:15:01,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:15:01,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:15:01,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:15:01,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:15:01,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:15:01,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:15:01,176 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:15:01,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:15:01,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:15:01,177 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:15:01,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:15:01,177 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan 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 -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2024-11-14 04:15:01,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:15:01,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:15:01,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:15:01,520 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:15:01,520 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:15:01,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i Unable to find full path for "g++" [2024-11-14 04:15:03,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:15:03,868 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:15:03,871 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2024-11-14 04:15:03,888 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/data/9a5003b7f/0169225c363645de94796e7e6bbc9a33/FLAG22f8ce8b0 [2024-11-14 04:15:03,912 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/data/9a5003b7f/0169225c363645de94796e7e6bbc9a33 [2024-11-14 04:15:03,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:15:03,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:15:03,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:15:03,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:15:03,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:15:03,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:15:03" (1/1) ... [2024-11-14 04:15:03,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b920a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:03, skipping insertion in model container [2024-11-14 04:15:03,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:15:03" (1/1) ... [2024-11-14 04:15:03,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:15:04,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:15:04,391 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:15:04,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:15:04,503 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:15:04,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:04 WrapperNode [2024-11-14 04:15:04,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:15:04,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:15:04,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:15:04,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:15:04,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:04" (1/1) ... [2024-11-14 04:15:04,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:04" (1/1) ... [2024-11-14 04:15:04,553 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2024-11-14 04:15:04,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:15:04,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:15:04,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:15:04,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:15:04,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:04" (1/1) ... [2024-11-14 04:15:04,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:04" (1/1) ... [2024-11-14 04:15:04,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:04" (1/1) ... [2024-11-14 04:15:04,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:04" (1/1) ... [2024-11-14 04:15:04,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:04" (1/1) ... [2024-11-14 04:15:04,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:04" (1/1) ... [2024-11-14 04:15:04,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:04" (1/1) ... [2024-11-14 04:15:04,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:04" (1/1) ... [2024-11-14 04:15:04,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:15:04,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:15:04,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:15:04,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:15:04,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:04" (1/1) ... [2024-11-14 04:15:04,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:15:04,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:15:04,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:15:04,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:15:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-14 04:15:04,694 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-14 04:15:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 04:15:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 04:15:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 04:15:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:15:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 04:15:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 04:15:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:15:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:15:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:15:04,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:15:04,831 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:15:04,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:15:05,381 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-14 04:15:05,382 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:15:05,478 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:15:05,478 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-14 04:15:05,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:15:05 BoogieIcfgContainer [2024-11-14 04:15:05,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:15:05,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:15:05,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:15:05,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:15:05,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:15:03" (1/3) ... [2024-11-14 04:15:05,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a1e5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:15:05, skipping insertion in model container [2024-11-14 04:15:05,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:04" (2/3) ... [2024-11-14 04:15:05,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a1e5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:15:05, skipping insertion in model container [2024-11-14 04:15:05,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:15:05" (3/3) ... [2024-11-14 04:15:05,491 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2024-11-14 04:15:05,508 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:15:05,510 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-cnstr_1-2.i that has 2 procedures, 125 locations, 1 initial locations, 6 loop locations, and 63 error locations. [2024-11-14 04:15:05,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:15:05,615 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@73c68320, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:15:05,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2024-11-14 04:15:05,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 57 states have (on average 2.4035087719298245) internal successors, (137), 120 states have internal predecessors, (137), 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) [2024-11-14 04:15:05,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 04:15:05,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:05,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 04:15:05,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:05,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:05,636 INFO L85 PathProgramCache]: Analyzing trace with hash 8786, now seen corresponding path program 1 times [2024-11-14 04:15:05,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:05,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760673040] [2024-11-14 04:15:05,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:05,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:05,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:15:05,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760673040] [2024-11-14 04:15:05,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760673040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:05,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:05,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 04:15:05,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887174608] [2024-11-14 04:15:05,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:05,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:15:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:05,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:15:05,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:15:05,908 INFO L87 Difference]: Start difference. First operand has 125 states, 57 states have (on average 2.4035087719298245) internal successors, (137), 120 states have internal predecessors, (137), 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) [2024-11-14 04:15:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:06,158 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2024-11-14 04:15:06,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:15:06,160 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 [2024-11-14 04:15:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:06,169 INFO L225 Difference]: With dead ends: 115 [2024-11-14 04:15:06,169 INFO L226 Difference]: Without dead ends: 114 [2024-11-14 04:15:06,171 INFO L431 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 [2024-11-14 04:15:06,175 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:06,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 63 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:15:06,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-14 04:15:06,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-14 04:15:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 112 states have internal predecessors, (120), 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) [2024-11-14 04:15:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2024-11-14 04:15:06,225 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 2 [2024-11-14 04:15:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:06,226 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2024-11-14 04:15:06,226 INFO L472 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) [2024-11-14 04:15:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2024-11-14 04:15:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 04:15:06,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:06,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 04:15:06,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:15:06,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:06,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:06,228 INFO L85 PathProgramCache]: Analyzing trace with hash 8787, now seen corresponding path program 1 times [2024-11-14 04:15:06,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:06,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044145199] [2024-11-14 04:15:06,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:06,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:06,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:15:06,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044145199] [2024-11-14 04:15:06,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044145199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:06,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:06,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 04:15:06,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786832598] [2024-11-14 04:15:06,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:06,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:15:06,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:06,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:15:06,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:15:06,374 INFO L87 Difference]: Start difference. First operand 114 states and 123 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) [2024-11-14 04:15:06,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:06,618 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2024-11-14 04:15:06,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:15:06,619 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 [2024-11-14 04:15:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:06,621 INFO L225 Difference]: With dead ends: 150 [2024-11-14 04:15:06,622 INFO L226 Difference]: Without dead ends: 150 [2024-11-14 04:15:06,622 INFO L431 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 [2024-11-14 04:15:06,623 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:06,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 126 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:15:06,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-14 04:15:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 133. [2024-11-14 04:15:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 77 states have (on average 2.064935064935065) internal successors, (159), 131 states have internal predecessors, (159), 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) [2024-11-14 04:15:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2024-11-14 04:15:06,640 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 2 [2024-11-14 04:15:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:06,643 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2024-11-14 04:15:06,643 INFO L472 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) [2024-11-14 04:15:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2024-11-14 04:15:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 04:15:06,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:06,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:06,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 04:15:06,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:06,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:06,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1874564004, now seen corresponding path program 1 times [2024-11-14 04:15:06,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:06,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171112514] [2024-11-14 04:15:06,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:06,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:06,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:15:06,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171112514] [2024-11-14 04:15:06,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171112514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:06,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:06,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:15:06,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453185846] [2024-11-14 04:15:06,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:06,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:15:06,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:06,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:15:06,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:15:06,917 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-11-14 04:15:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:07,165 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2024-11-14 04:15:07,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:15:07,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-14 04:15:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:07,167 INFO L225 Difference]: With dead ends: 126 [2024-11-14 04:15:07,167 INFO L226 Difference]: Without dead ends: 126 [2024-11-14 04:15:07,170 INFO L431 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 [2024-11-14 04:15:07,172 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 114 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:07,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 50 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:15:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-14 04:15:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-14 04:15:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 83 states have (on average 1.8674698795180722) internal successors, (155), 124 states have internal predecessors, (155), 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) [2024-11-14 04:15:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 158 transitions. [2024-11-14 04:15:07,190 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 158 transitions. Word has length 7 [2024-11-14 04:15:07,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:07,190 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 158 transitions. [2024-11-14 04:15:07,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-11-14 04:15:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2024-11-14 04:15:07,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 04:15:07,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:07,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:07,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 04:15:07,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:07,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1874564003, now seen corresponding path program 1 times [2024-11-14 04:15:07,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:07,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026757709] [2024-11-14 04:15:07,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:07,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:07,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:15:07,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026757709] [2024-11-14 04:15:07,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026757709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:07,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:07,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:15:07,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542227961] [2024-11-14 04:15:07,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:07,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:15:07,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:07,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:15:07,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:15:07,469 INFO L87 Difference]: Start difference. First operand 126 states and 158 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2024-11-14 04:15:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:07,742 INFO L93 Difference]: Finished difference Result 149 states and 182 transitions. [2024-11-14 04:15:07,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:15:07,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2024-11-14 04:15:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:07,744 INFO L225 Difference]: With dead ends: 149 [2024-11-14 04:15:07,744 INFO L226 Difference]: Without dead ends: 149 [2024-11-14 04:15:07,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:15:07,745 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 218 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:07,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 73 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:15:07,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-14 04:15:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 117. [2024-11-14 04:15:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 75 states have (on average 1.7333333333333334) internal successors, (130), 115 states have internal predecessors, (130), 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) [2024-11-14 04:15:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2024-11-14 04:15:07,753 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 7 [2024-11-14 04:15:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:07,753 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2024-11-14 04:15:07,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2024-11-14 04:15:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2024-11-14 04:15:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 04:15:07,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:07,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:07,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 04:15:07,754 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:07,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:07,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1864505003, now seen corresponding path program 1 times [2024-11-14 04:15:07,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:07,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645382181] [2024-11-14 04:15:07,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:07,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:07,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:15:07,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645382181] [2024-11-14 04:15:07,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645382181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:07,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:07,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:15:07,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312569472] [2024-11-14 04:15:07,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:07,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:15:07,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:07,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:15:07,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:15:07,938 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2024-11-14 04:15:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:08,145 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2024-11-14 04:15:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:15:08,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2024-11-14 04:15:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:08,147 INFO L225 Difference]: With dead ends: 116 [2024-11-14 04:15:08,147 INFO L226 Difference]: Without dead ends: 116 [2024-11-14 04:15:08,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:15:08,148 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:08,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 223 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:15:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-14 04:15:08,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-14 04:15:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 75 states have (on average 1.7066666666666668) internal successors, (128), 114 states have internal predecessors, (128), 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) [2024-11-14 04:15:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2024-11-14 04:15:08,158 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 9 [2024-11-14 04:15:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:08,159 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2024-11-14 04:15:08,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2024-11-14 04:15:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2024-11-14 04:15:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 04:15:08,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:08,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:08,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 04:15:08,160 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:08,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1864505002, now seen corresponding path program 1 times [2024-11-14 04:15:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:08,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412237143] [2024-11-14 04:15:08,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:08,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:08,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:15:08,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412237143] [2024-11-14 04:15:08,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412237143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:08,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:08,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:15:08,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723752813] [2024-11-14 04:15:08,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:08,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:15:08,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:08,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:15:08,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:15:08,382 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2024-11-14 04:15:08,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:08,635 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2024-11-14 04:15:08,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:15:08,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2024-11-14 04:15:08,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:08,637 INFO L225 Difference]: With dead ends: 115 [2024-11-14 04:15:08,637 INFO L226 Difference]: Without dead ends: 115 [2024-11-14 04:15:08,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:15:08,638 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:08,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 210 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:15:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-14 04:15:08,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-14 04:15:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.68) internal successors, (126), 113 states have internal predecessors, (126), 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) [2024-11-14 04:15:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2024-11-14 04:15:08,652 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 9 [2024-11-14 04:15:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:08,652 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2024-11-14 04:15:08,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2024-11-14 04:15:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2024-11-14 04:15:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 04:15:08,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:08,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:08,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 04:15:08,653 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:08,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:08,653 INFO L85 PathProgramCache]: Analyzing trace with hash -989207552, now seen corresponding path program 1 times [2024-11-14 04:15:08,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:08,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284447013] [2024-11-14 04:15:08,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:08,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:08,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:15:08,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284447013] [2024-11-14 04:15:08,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284447013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:08,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:08,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:15:08,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811888111] [2024-11-14 04:15:08,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:08,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:15:08,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:08,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:15:08,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:15:08,726 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:15:08,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:08,901 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2024-11-14 04:15:08,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:15:08,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 04:15:08,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:08,903 INFO L225 Difference]: With dead ends: 120 [2024-11-14 04:15:08,903 INFO L226 Difference]: Without dead ends: 120 [2024-11-14 04:15:08,903 INFO L431 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 [2024-11-14 04:15:08,904 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 104 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:08,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 110 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:15:08,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-14 04:15:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2024-11-14 04:15:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 75 states have (on average 1.64) internal successors, (123), 112 states have internal predecessors, (123), 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) [2024-11-14 04:15:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2024-11-14 04:15:08,916 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 11 [2024-11-14 04:15:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:08,917 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2024-11-14 04:15:08,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:15:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2024-11-14 04:15:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 04:15:08,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:08,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:08,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 04:15:08,918 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:08,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:08,918 INFO L85 PathProgramCache]: Analyzing trace with hash -787738788, now seen corresponding path program 1 times [2024-11-14 04:15:08,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:08,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998582131] [2024-11-14 04:15:08,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:08,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:09,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:15:09,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998582131] [2024-11-14 04:15:09,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998582131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:09,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:09,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 04:15:09,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954920518] [2024-11-14 04:15:09,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:09,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 04:15:09,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:09,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 04:15:09,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-14 04:15:09,512 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:15:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:10,143 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2024-11-14 04:15:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:15:10,144 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 04:15:10,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:10,145 INFO L225 Difference]: With dead ends: 137 [2024-11-14 04:15:10,145 INFO L226 Difference]: Without dead ends: 137 [2024-11-14 04:15:10,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-14 04:15:10,146 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 137 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:10,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 183 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:15:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-14 04:15:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2024-11-14 04:15:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 89 states have (on average 1.595505617977528) internal successors, (142), 126 states have internal predecessors, (142), 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) [2024-11-14 04:15:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2024-11-14 04:15:10,153 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 11 [2024-11-14 04:15:10,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:10,153 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2024-11-14 04:15:10,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:15:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2024-11-14 04:15:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 04:15:10,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:10,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:10,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 04:15:10,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:10,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash -787738789, now seen corresponding path program 1 times [2024-11-14 04:15:10,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:10,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106752995] [2024-11-14 04:15:10,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:10,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:10,393 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:15:10,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106752995] [2024-11-14 04:15:10,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106752995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:10,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:10,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 04:15:10,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495503105] [2024-11-14 04:15:10,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:10,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 04:15:10,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:10,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 04:15:10,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:15:10,394 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:15:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:10,776 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2024-11-14 04:15:10,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:15:10,777 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 04:15:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:10,778 INFO L225 Difference]: With dead ends: 127 [2024-11-14 04:15:10,778 INFO L226 Difference]: Without dead ends: 127 [2024-11-14 04:15:10,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-14 04:15:10,780 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 105 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:10,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 120 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:15:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-14 04:15:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-14 04:15:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 89 states have (on average 1.5730337078651686) internal successors, (140), 125 states have internal predecessors, (140), 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) [2024-11-14 04:15:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 142 transitions. [2024-11-14 04:15:10,791 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 142 transitions. Word has length 11 [2024-11-14 04:15:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:10,792 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 142 transitions. [2024-11-14 04:15:10,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:15:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 142 transitions. [2024-11-14 04:15:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 04:15:10,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:10,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:10,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 04:15:10,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:10,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1783851028, now seen corresponding path program 1 times [2024-11-14 04:15:10,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:10,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341050616] [2024-11-14 04:15:10,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:10,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:10,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:15:10,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341050616] [2024-11-14 04:15:10,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341050616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:10,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:10,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:15:10,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546460109] [2024-11-14 04:15:10,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:10,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:15:10,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:10,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:15:10,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:15:10,898 INFO L87 Difference]: Start difference. First operand 127 states and 142 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-14 04:15:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:11,129 INFO L93 Difference]: Finished difference Result 168 states and 190 transitions. [2024-11-14 04:15:11,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:15:11,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 14 [2024-11-14 04:15:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:11,131 INFO L225 Difference]: With dead ends: 168 [2024-11-14 04:15:11,131 INFO L226 Difference]: Without dead ends: 168 [2024-11-14 04:15:11,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:15:11,132 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 61 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:11,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 210 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:15:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-14 04:15:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2024-11-14 04:15:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 94 states have (on average 1.5425531914893618) internal successors, (145), 130 states have internal predecessors, (145), 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) [2024-11-14 04:15:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2024-11-14 04:15:11,139 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 147 transitions. Word has length 14 [2024-11-14 04:15:11,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:11,139 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 147 transitions. [2024-11-14 04:15:11,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-14 04:15:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2024-11-14 04:15:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 04:15:11,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:11,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:11,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 04:15:11,140 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:11,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:11,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1977752137, now seen corresponding path program 1 times [2024-11-14 04:15:11,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:11,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125586041] [2024-11-14 04:15:11,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:11,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:11,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:15:11,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125586041] [2024-11-14 04:15:11,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125586041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:11,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:11,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:15:11,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539842979] [2024-11-14 04:15:11,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:11,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:15:11,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:11,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:15:11,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:15:11,292 INFO L87 Difference]: Start difference. First operand 132 states and 147 transitions. Second operand has 5 states, 4 states have (on average 4.0) 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) [2024-11-14 04:15:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:11,463 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2024-11-14 04:15:11,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:15:11,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) 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 [2024-11-14 04:15:11,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:11,464 INFO L225 Difference]: With dead ends: 131 [2024-11-14 04:15:11,464 INFO L226 Difference]: Without dead ends: 131 [2024-11-14 04:15:11,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:15:11,465 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:11,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 210 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:15:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-14 04:15:11,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-14 04:15:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 129 states have internal predecessors, (143), 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) [2024-11-14 04:15:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2024-11-14 04:15:11,470 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 16 [2024-11-14 04:15:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:11,470 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2024-11-14 04:15:11,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) 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) [2024-11-14 04:15:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2024-11-14 04:15:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 04:15:11,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:11,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:11,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 04:15:11,472 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:11,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1977752136, now seen corresponding path program 1 times [2024-11-14 04:15:11,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:11,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908060329] [2024-11-14 04:15:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:11,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:15:11,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908060329] [2024-11-14 04:15:11,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908060329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:11,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:11,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:15:11,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779689015] [2024-11-14 04:15:11,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:11,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:15:11,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:11,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:15:11,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:15:11,723 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand has 5 states, 4 states have (on average 4.0) 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) [2024-11-14 04:15:11,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:11,922 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2024-11-14 04:15:11,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:15:11,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) 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 [2024-11-14 04:15:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:11,923 INFO L225 Difference]: With dead ends: 130 [2024-11-14 04:15:11,923 INFO L226 Difference]: Without dead ends: 130 [2024-11-14 04:15:11,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:15:11,924 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:11,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 195 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:15:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-14 04:15:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-14 04:15:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 94 states have (on average 1.5) internal successors, (141), 128 states have internal predecessors, (141), 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) [2024-11-14 04:15:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2024-11-14 04:15:11,929 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 16 [2024-11-14 04:15:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:11,929 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2024-11-14 04:15:11,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) 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) [2024-11-14 04:15:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2024-11-14 04:15:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 04:15:11,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:11,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:11,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 04:15:11,930 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:11,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:11,930 INFO L85 PathProgramCache]: Analyzing trace with hash -609907697, now seen corresponding path program 1 times [2024-11-14 04:15:11,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:11,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415063830] [2024-11-14 04:15:11,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:11,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:11,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:15:11,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415063830] [2024-11-14 04:15:11,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415063830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:11,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:11,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:15:11,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426142464] [2024-11-14 04:15:11,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:12,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:15:12,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:12,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:15:12,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:15:12,000 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:15:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:12,188 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2024-11-14 04:15:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:15:12,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 04:15:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:12,189 INFO L225 Difference]: With dead ends: 130 [2024-11-14 04:15:12,189 INFO L226 Difference]: Without dead ends: 130 [2024-11-14 04:15:12,190 INFO L431 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 [2024-11-14 04:15:12,190 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 10 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:12,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 194 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:15:12,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-14 04:15:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-11-14 04:15:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 127 states have internal predecessors, (139), 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) [2024-11-14 04:15:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2024-11-14 04:15:12,195 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 17 [2024-11-14 04:15:12,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:12,195 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2024-11-14 04:15:12,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:15:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2024-11-14 04:15:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 04:15:12,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:12,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:12,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 04:15:12,196 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:12,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2050880382, now seen corresponding path program 1 times [2024-11-14 04:15:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:12,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210094295] [2024-11-14 04:15:12,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:12,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:12,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:15:12,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210094295] [2024-11-14 04:15:12,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210094295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:12,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:12,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:15:12,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4238184] [2024-11-14 04:15:12,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:12,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:15:12,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:12,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:15:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:15:12,458 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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) [2024-11-14 04:15:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:12,718 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2024-11-14 04:15:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:15:12,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2024-11-14 04:15:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:12,720 INFO L225 Difference]: With dead ends: 128 [2024-11-14 04:15:12,720 INFO L226 Difference]: Without dead ends: 128 [2024-11-14 04:15:12,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-14 04:15:12,720 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 27 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:12,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 128 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:15:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-14 04:15:12,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-14 04:15:12,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 93 states have (on average 1.4838709677419355) internal successors, (138), 126 states have internal predecessors, (138), 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) [2024-11-14 04:15:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2024-11-14 04:15:12,728 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 18 [2024-11-14 04:15:12,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:12,728 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2024-11-14 04:15:12,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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) [2024-11-14 04:15:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2024-11-14 04:15:12,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 04:15:12,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:12,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:12,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 04:15:12,731 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:12,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2050880383, now seen corresponding path program 1 times [2024-11-14 04:15:12,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:12,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863425444] [2024-11-14 04:15:12,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:12,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:13,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:15:13,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863425444] [2024-11-14 04:15:13,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863425444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:13,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:13,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 04:15:13,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392344892] [2024-11-14 04:15:13,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:13,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 04:15:13,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:13,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 04:15:13,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:15:13,127 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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) [2024-11-14 04:15:13,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:13,518 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2024-11-14 04:15:13,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:15:13,519 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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 18 [2024-11-14 04:15:13,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:13,519 INFO L225 Difference]: With dead ends: 133 [2024-11-14 04:15:13,520 INFO L226 Difference]: Without dead ends: 133 [2024-11-14 04:15:13,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-14 04:15:13,520 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 33 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:13,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 203 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:15:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-14 04:15:13,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2024-11-14 04:15:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 124 states have internal predecessors, (136), 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) [2024-11-14 04:15:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2024-11-14 04:15:13,525 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 18 [2024-11-14 04:15:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:13,525 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2024-11-14 04:15:13,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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) [2024-11-14 04:15:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2024-11-14 04:15:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 04:15:13,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:13,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:13,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 04:15:13,526 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:13,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:13,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1845674901, now seen corresponding path program 1 times [2024-11-14 04:15:13,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:15:13,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393815273] [2024-11-14 04:15:13,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:13,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:15:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:15:13,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:15:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:15:13,576 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:15:13,576 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:15:13,577 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (62 of 63 remaining) [2024-11-14 04:15:13,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 63 remaining) [2024-11-14 04:15:13,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 63 remaining) [2024-11-14 04:15:13,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 63 remaining) [2024-11-14 04:15:13,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 63 remaining) [2024-11-14 04:15:13,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 63 remaining) [2024-11-14 04:15:13,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 63 remaining) [2024-11-14 04:15:13,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 63 remaining) [2024-11-14 04:15:13,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 63 remaining) [2024-11-14 04:15:13,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 63 remaining) [2024-11-14 04:15:13,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 63 remaining) [2024-11-14 04:15:13,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 63 remaining) [2024-11-14 04:15:13,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 63 remaining) [2024-11-14 04:15:13,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 63 remaining) [2024-11-14 04:15:13,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 63 remaining) [2024-11-14 04:15:13,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 63 remaining) [2024-11-14 04:15:13,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 63 remaining) [2024-11-14 04:15:13,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 63 remaining) [2024-11-14 04:15:13,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 63 remaining) [2024-11-14 04:15:13,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 63 remaining) [2024-11-14 04:15:13,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 63 remaining) [2024-11-14 04:15:13,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 63 remaining) [2024-11-14 04:15:13,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 63 remaining) [2024-11-14 04:15:13,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 63 remaining) [2024-11-14 04:15:13,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 63 remaining) [2024-11-14 04:15:13,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 63 remaining) [2024-11-14 04:15:13,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 63 remaining) [2024-11-14 04:15:13,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 63 remaining) [2024-11-14 04:15:13,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 63 remaining) [2024-11-14 04:15:13,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 63 remaining) [2024-11-14 04:15:13,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 63 remaining) [2024-11-14 04:15:13,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 63 remaining) [2024-11-14 04:15:13,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 63 remaining) [2024-11-14 04:15:13,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 63 remaining) [2024-11-14 04:15:13,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 63 remaining) [2024-11-14 04:15:13,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 63 remaining) [2024-11-14 04:15:13,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 63 remaining) [2024-11-14 04:15:13,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 63 remaining) [2024-11-14 04:15:13,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 63 remaining) [2024-11-14 04:15:13,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 63 remaining) [2024-11-14 04:15:13,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 63 remaining) [2024-11-14 04:15:13,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 63 remaining) [2024-11-14 04:15:13,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 63 remaining) [2024-11-14 04:15:13,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 63 remaining) [2024-11-14 04:15:13,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 63 remaining) [2024-11-14 04:15:13,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 63 remaining) [2024-11-14 04:15:13,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 63 remaining) [2024-11-14 04:15:13,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 63 remaining) [2024-11-14 04:15:13,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 63 remaining) [2024-11-14 04:15:13,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (13 of 63 remaining) [2024-11-14 04:15:13,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (12 of 63 remaining) [2024-11-14 04:15:13,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (11 of 63 remaining) [2024-11-14 04:15:13,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 63 remaining) [2024-11-14 04:15:13,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 63 remaining) [2024-11-14 04:15:13,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (8 of 63 remaining) [2024-11-14 04:15:13,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE (7 of 63 remaining) [2024-11-14 04:15:13,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE (6 of 63 remaining) [2024-11-14 04:15:13,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 63 remaining) [2024-11-14 04:15:13,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 63 remaining) [2024-11-14 04:15:13,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (3 of 63 remaining) [2024-11-14 04:15:13,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE (2 of 63 remaining) [2024-11-14 04:15:13,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE (1 of 63 remaining) [2024-11-14 04:15:13,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK (0 of 63 remaining) [2024-11-14 04:15:13,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 04:15:13,593 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:13,619 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:15:13,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:15:13 BoogieIcfgContainer [2024-11-14 04:15:13,624 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:15:13,625 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:15:13,625 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:15:13,625 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:15:13,626 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:15:05" (3/4) ... [2024-11-14 04:15:13,629 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 04:15:13,630 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:15:13,631 INFO L158 Benchmark]: Toolchain (without parser) took 9714.14ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 91.2MB in the beginning and 53.4MB in the end (delta: 37.9MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2024-11-14 04:15:13,631 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 83.9MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:15:13,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.25ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 73.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 04:15:13,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.37ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 71.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:15:13,633 INFO L158 Benchmark]: Boogie Preprocessor took 48.23ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 70.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:15:13,633 INFO L158 Benchmark]: RCFGBuilder took 873.52ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 40.7MB in the end (delta: 29.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 04:15:13,633 INFO L158 Benchmark]: TraceAbstraction took 8143.14ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 40.2MB in the beginning and 53.4MB in the end (delta: -13.2MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-14 04:15:13,634 INFO L158 Benchmark]: Witness Printer took 5.21ms. Allocated memory is still 142.6MB. Free memory was 53.4MB in the beginning and 53.4MB in the end (delta: 11.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:15:13,636 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.10ms. Allocated memory is still 83.9MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.25ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 73.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.37ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 71.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.23ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 70.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 873.52ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 40.7MB in the end (delta: 29.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8143.14ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 40.2MB in the beginning and 53.4MB in the end (delta: -13.2MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Witness Printer took 5.21ms. Allocated memory is still 142.6MB. Free memory was 53.4MB in the beginning and 53.4MB in the end (delta: 11.8kB). 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: 991]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 991. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) VAL [list={-1:0}] [L1007] list->prev = ((void*)0) VAL [list={-1:0}] [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list VAL [end={-1:0}, list={-1:0}] [L1040] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1041] EXPR end->colour VAL [end={-1:0}, list={-1:0}] [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}] [L1045] EXPR end->colour VAL [end={-1:0}, list={-1:0}] [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next VAL [end={-1:0}, list={-1:0}] [L1051] COND TRUE !(end->next) [L1051] CALL reach_error() [L991] COND FALSE !(0) [L991] __assert_fail ("0", "dll-rb-cnstr_1-2.c", 11, __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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - 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: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: 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: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: 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, 125 locations, 63 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 951 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 951 mSDsluCounter, 2298 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1408 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3052 IncrementalHoareTripleChecker+Invalid, 3184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 890 mSDtfsCounter, 3052 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=2, InterpolantAutomatonStates: 80, 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, 15 MinimizatonAttempts, 108 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 798 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 [2024-11-14 04:15:13,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:15:16,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:15:16,662 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 04:15:16,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:15:16,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:15:16,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:15:16,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:15:16,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:15:16,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:15:16,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:15:16,718 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:15:16,718 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:15:16,719 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:15:16,719 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:15:16,720 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:15:16,720 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:15:16,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 04:15:16,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 04:15:16,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:15:16,721 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:15:16,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:15:16,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:15:16,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:15:16,722 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 04:15:16,722 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 04:15:16,722 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 04:15:16,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:15:16,722 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:15:16,722 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 04:15:16,722 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:15:16,722 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 04:15:16,722 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 04:15:16,722 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:15:16,722 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:15:16,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:15:16,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 04:15:16,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:15:16,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:15:16,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:15:16,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:15:16,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:15:16,723 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 04:15:16,723 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 04:15:16,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:15:16,725 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:15:16,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan 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 -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2024-11-14 04:15:17,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:15:17,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:15:17,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:15:17,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:15:17,109 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:15:17,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i Unable to find full path for "g++" [2024-11-14 04:15:19,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:15:19,906 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:15:19,907 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2024-11-14 04:15:19,918 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/data/b99605fc6/ffcae745fdce43958e111bf121438a3f/FLAG8d89c3380 [2024-11-14 04:15:19,934 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/data/b99605fc6/ffcae745fdce43958e111bf121438a3f [2024-11-14 04:15:19,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:15:19,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:15:19,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:15:19,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:15:19,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:15:19,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:15:19" (1/1) ... [2024-11-14 04:15:19,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e970791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:19, skipping insertion in model container [2024-11-14 04:15:19,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:15:19" (1/1) ... [2024-11-14 04:15:19,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:15:20,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:15:20,475 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:15:20,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:15:20,598 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:15:20,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:20 WrapperNode [2024-11-14 04:15:20,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:15:20,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:15:20,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:15:20,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:15:20,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:20" (1/1) ... [2024-11-14 04:15:20,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:20" (1/1) ... [2024-11-14 04:15:20,662 INFO L138 Inliner]: procedures = 122, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2024-11-14 04:15:20,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:15:20,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:15:20,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:15:20,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:15:20,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:20" (1/1) ... [2024-11-14 04:15:20,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:20" (1/1) ... [2024-11-14 04:15:20,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:20" (1/1) ... [2024-11-14 04:15:20,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:20" (1/1) ... [2024-11-14 04:15:20,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:20" (1/1) ... [2024-11-14 04:15:20,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:20" (1/1) ... [2024-11-14 04:15:20,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:20" (1/1) ... [2024-11-14 04:15:20,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:20" (1/1) ... [2024-11-14 04:15:20,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:15:20,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:15:20,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:15:20,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:15:20,713 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:20" (1/1) ... [2024-11-14 04:15:20,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:15:20,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:15:20,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:15:20,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:15:20,786 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-14 04:15:20,786 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-14 04:15:20,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 04:15:20,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 04:15:20,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:15:20,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 04:15:20,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 04:15:20,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:15:20,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 04:15:20,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 04:15:20,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:15:20,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:15:20,966 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:15:20,969 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:15:21,936 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-14 04:15:21,937 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:15:21,957 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:15:21,957 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-14 04:15:21,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:15:21 BoogieIcfgContainer [2024-11-14 04:15:21,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:15:21,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:15:21,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:15:21,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:15:21,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:15:19" (1/3) ... [2024-11-14 04:15:21,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3782f607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:15:21, skipping insertion in model container [2024-11-14 04:15:21,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:20" (2/3) ... [2024-11-14 04:15:21,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3782f607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:15:21, skipping insertion in model container [2024-11-14 04:15:21,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:15:21" (3/3) ... [2024-11-14 04:15:21,971 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2024-11-14 04:15:21,988 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:15:21,990 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-cnstr_1-2.i that has 2 procedures, 143 locations, 1 initial locations, 6 loop locations, and 63 error locations. [2024-11-14 04:15:22,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:15:22,064 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@63fd1d91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:15:22,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2024-11-14 04:15:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 75 states have (on average 2.0933333333333333) internal successors, (157), 138 states have internal predecessors, (157), 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) [2024-11-14 04:15:22,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 04:15:22,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:22,077 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 04:15:22,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:22,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:22,083 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-14 04:15:22,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:15:22,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175958954] [2024-11-14 04:15:22,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:22,097 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 [2024-11-14 04:15:22,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:15:22,101 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:15:22,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:22,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:15:22,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:15:22,273 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 [2024-11-14 04:15:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:22,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:15:22,299 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:15:22,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175958954] [2024-11-14 04:15:22,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175958954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:22,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:22,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:15:22,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302778729] [2024-11-14 04:15:22,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:22,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:15:22,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:15:22,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:15:22,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:15:22,351 INFO L87 Difference]: Start difference. First operand has 143 states, 75 states have (on average 2.0933333333333333) internal successors, (157), 138 states have internal predecessors, (157), 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.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-14 04:15:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:22,806 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2024-11-14 04:15:22,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:15:22,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-14 04:15:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:22,817 INFO L225 Difference]: With dead ends: 133 [2024-11-14 04:15:22,817 INFO L226 Difference]: Without dead ends: 131 [2024-11-14 04:15:22,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:15:22,822 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 103 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:22,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 85 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 04:15:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-14 04:15:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-14 04:15:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.9027777777777777) internal successors, (137), 129 states have internal predecessors, (137), 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) [2024-11-14 04:15:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2024-11-14 04:15:22,888 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 3 [2024-11-14 04:15:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:22,888 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2024-11-14 04:15:22,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-14 04:15:22,889 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2024-11-14 04:15:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 04:15:22,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:22,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 04:15:22,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 04:15:23,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:23,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:23,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:23,092 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-14 04:15:23,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:15:23,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939758316] [2024-11-14 04:15:23,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:23,093 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 [2024-11-14 04:15:23,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:15:23,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:15:23,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:23,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:15:23,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:15:23,181 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 [2024-11-14 04:15:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:23,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:15:23,207 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:15:23,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939758316] [2024-11-14 04:15:23,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939758316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:23,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:23,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:15:23,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514927784] [2024-11-14 04:15:23,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:23,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:15:23,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:15:23,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:15:23,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:15:23,211 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-14 04:15:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:23,620 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2024-11-14 04:15:23,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:15:23,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-14 04:15:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:23,621 INFO L225 Difference]: With dead ends: 135 [2024-11-14 04:15:23,622 INFO L226 Difference]: Without dead ends: 135 [2024-11-14 04:15:23,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:15:23,622 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 97 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:23,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 96 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 04:15:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-14 04:15:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-14 04:15:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 79 states have (on average 1.7848101265822784) internal successors, (141), 133 states have internal predecessors, (141), 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) [2024-11-14 04:15:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2024-11-14 04:15:23,635 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 3 [2024-11-14 04:15:23,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:23,639 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2024-11-14 04:15:23,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-14 04:15:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2024-11-14 04:15:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 04:15:23,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:23,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:23,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 04:15:23,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:23,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:23,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:23,841 INFO L85 PathProgramCache]: Analyzing trace with hash 919163538, now seen corresponding path program 1 times [2024-11-14 04:15:23,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:15:23,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283289915] [2024-11-14 04:15:23,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:23,842 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 [2024-11-14 04:15:23,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:15:23,845 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:15:23,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:23,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 04:15:23,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:15:23,937 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 [2024-11-14 04:15:24,007 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 04:15:24,007 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 [2024-11-14 04:15:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:24,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:15:24,034 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:15:24,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283289915] [2024-11-14 04:15:24,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283289915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:24,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:24,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:15:24,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792907103] [2024-11-14 04:15:24,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:24,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:15:24,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:15:24,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:15:24,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:15:24,036 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-14 04:15:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:24,562 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2024-11-14 04:15:24,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:15:24,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-14 04:15:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:24,564 INFO L225 Difference]: With dead ends: 125 [2024-11-14 04:15:24,565 INFO L226 Difference]: Without dead ends: 125 [2024-11-14 04:15:24,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:15:24,566 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 134 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:24,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 69 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:15:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-14 04:15:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-14 04:15:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 123 states have internal predecessors, (134), 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) [2024-11-14 04:15:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2024-11-14 04:15:24,578 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 9 [2024-11-14 04:15:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:24,578 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2024-11-14 04:15:24,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-14 04:15:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2024-11-14 04:15:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 04:15:24,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:24,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:24,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 04:15:24,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:24,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:24,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:24,783 INFO L85 PathProgramCache]: Analyzing trace with hash 919163539, now seen corresponding path program 1 times [2024-11-14 04:15:24,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:15:24,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453419846] [2024-11-14 04:15:24,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:24,784 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 [2024-11-14 04:15:24,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:15:24,788 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:15:24,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:24,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 04:15:24,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:15:24,920 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 [2024-11-14 04:15:25,076 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 04:15:25,076 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 [2024-11-14 04:15:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:25,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:15:25,099 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:15:25,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453419846] [2024-11-14 04:15:25,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453419846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:25,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:25,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:15:25,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970055954] [2024-11-14 04:15:25,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:25,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:15:25,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:15:25,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:15:25,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:15:25,101 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-14 04:15:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:25,695 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2024-11-14 04:15:25,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:15:25,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-14 04:15:25,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:25,696 INFO L225 Difference]: With dead ends: 142 [2024-11-14 04:15:25,697 INFO L226 Difference]: Without dead ends: 142 [2024-11-14 04:15:25,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:15:25,698 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 126 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:25,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 109 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 04:15:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-14 04:15:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2024-11-14 04:15:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 96 states have (on average 1.5729166666666667) internal successors, (151), 136 states have internal predecessors, (151), 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) [2024-11-14 04:15:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 154 transitions. [2024-11-14 04:15:25,711 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 154 transitions. Word has length 9 [2024-11-14 04:15:25,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:25,711 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 154 transitions. [2024-11-14 04:15:25,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-14 04:15:25,712 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 154 transitions. [2024-11-14 04:15:25,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 04:15:25,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:25,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:25,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 04:15:25,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:25,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:25,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:25,915 INFO L85 PathProgramCache]: Analyzing trace with hash 899989302, now seen corresponding path program 1 times [2024-11-14 04:15:25,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:15:25,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560488495] [2024-11-14 04:15:25,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:25,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 [2024-11-14 04:15:25,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:15:25,920 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:15:25,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:25,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:15:25,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:15:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:26,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:15:26,030 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:15:26,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560488495] [2024-11-14 04:15:26,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560488495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:26,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:26,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:15:26,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093337704] [2024-11-14 04:15:26,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:26,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:15:26,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:15:26,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:15:26,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:15:26,032 INFO L87 Difference]: Start difference. First operand 138 states and 154 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2024-11-14 04:15:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:26,371 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2024-11-14 04:15:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:15:26,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 [2024-11-14 04:15:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:26,372 INFO L225 Difference]: With dead ends: 145 [2024-11-14 04:15:26,372 INFO L226 Difference]: Without dead ends: 145 [2024-11-14 04:15:26,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:15:26,373 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 127 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:26,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 155 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:15:26,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-14 04:15:26,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2024-11-14 04:15:26,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 96 states have (on average 1.5416666666666667) internal successors, (148), 135 states have internal predecessors, (148), 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) [2024-11-14 04:15:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2024-11-14 04:15:26,386 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 13 [2024-11-14 04:15:26,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:26,386 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2024-11-14 04:15:26,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2024-11-14 04:15:26,387 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2024-11-14 04:15:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 04:15:26,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:26,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:26,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 04:15:26,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:26,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:26,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:26,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1910514731, now seen corresponding path program 1 times [2024-11-14 04:15:26,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:15:26,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940752343] [2024-11-14 04:15:26,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:26,589 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 [2024-11-14 04:15:26,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:15:26,591 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:15:26,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:26,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 04:15:26,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:15:26,705 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 [2024-11-14 04:15:26,728 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 [2024-11-14 04:15:26,765 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 [2024-11-14 04:15:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:26,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:15:26,782 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:15:26,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940752343] [2024-11-14 04:15:26,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940752343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:26,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:26,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:15:26,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533191383] [2024-11-14 04:15:26,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:26,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:15:26,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:15:26,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:15:26,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:15:26,783 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2024-11-14 04:15:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:27,279 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2024-11-14 04:15:27,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:15:27,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-11-14 04:15:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:27,281 INFO L225 Difference]: With dead ends: 136 [2024-11-14 04:15:27,281 INFO L226 Difference]: Without dead ends: 136 [2024-11-14 04:15:27,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:15:27,282 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:27,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 286 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:15:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-14 04:15:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-14 04:15:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 96 states have (on average 1.5208333333333333) internal successors, (146), 134 states have internal predecessors, (146), 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) [2024-11-14 04:15:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2024-11-14 04:15:27,288 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 12 [2024-11-14 04:15:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:27,289 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2024-11-14 04:15:27,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2024-11-14 04:15:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2024-11-14 04:15:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 04:15:27,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:27,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:27,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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)] Forceful destruction successful, exit code 0 [2024-11-14 04:15:27,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:27,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:27,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:27,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1910514730, now seen corresponding path program 1 times [2024-11-14 04:15:27,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:15:27,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444119117] [2024-11-14 04:15:27,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:27,491 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 [2024-11-14 04:15:27,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:15:27,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:15:27,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:27,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 04:15:27,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:15:27,596 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 [2024-11-14 04:15:27,638 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 [2024-11-14 04:15:27,647 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 [2024-11-14 04:15:27,713 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 [2024-11-14 04:15:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:27,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:15:27,740 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:15:27,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444119117] [2024-11-14 04:15:27,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444119117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:27,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:27,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:15:27,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083292270] [2024-11-14 04:15:27,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:27,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:15:27,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:15:27,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:15:27,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:15:27,743 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2024-11-14 04:15:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:28,349 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2024-11-14 04:15:28,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:15:28,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-11-14 04:15:28,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:28,351 INFO L225 Difference]: With dead ends: 135 [2024-11-14 04:15:28,351 INFO L226 Difference]: Without dead ends: 135 [2024-11-14 04:15:28,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:15:28,352 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 2 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:28,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 04:15:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-14 04:15:28,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-14 04:15:28,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 96 states have (on average 1.5) internal successors, (144), 133 states have internal predecessors, (144), 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) [2024-11-14 04:15:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2024-11-14 04:15:28,371 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 12 [2024-11-14 04:15:28,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:28,371 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2024-11-14 04:15:28,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2024-11-14 04:15:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2024-11-14 04:15:28,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 04:15:28,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:28,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:28,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 04:15:28,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:28,577 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:28,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:28,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1971820298, now seen corresponding path program 1 times [2024-11-14 04:15:28,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:15:28,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500525312] [2024-11-14 04:15:28,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:28,579 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 [2024-11-14 04:15:28,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:15:28,586 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:15:28,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:28,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 04:15:28,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:15:28,693 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 [2024-11-14 04:15:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:28,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:15:28,777 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:15:28,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500525312] [2024-11-14 04:15:28,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500525312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:28,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:28,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:15:28,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915404959] [2024-11-14 04:15:28,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:28,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:15:28,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:15:28,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:15:28,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:15:28,779 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2024-11-14 04:15:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:29,318 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2024-11-14 04:15:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:15:29,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 16 [2024-11-14 04:15:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:29,320 INFO L225 Difference]: With dead ends: 181 [2024-11-14 04:15:29,320 INFO L226 Difference]: Without dead ends: 181 [2024-11-14 04:15:29,320 INFO L431 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 [2024-11-14 04:15:29,321 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 67 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:29,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 297 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:15:29,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-14 04:15:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 140. [2024-11-14 04:15:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 101 states have (on average 1.4752475247524752) internal successors, (149), 138 states have internal predecessors, (149), 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) [2024-11-14 04:15:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2024-11-14 04:15:29,327 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 16 [2024-11-14 04:15:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:29,327 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2024-11-14 04:15:29,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2024-11-14 04:15:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2024-11-14 04:15:29,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 04:15:29,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:29,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:29,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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)] Forceful destruction successful, exit code 0 [2024-11-14 04:15:29,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:29,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:29,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:29,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2139547560, now seen corresponding path program 1 times [2024-11-14 04:15:29,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:15:29,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879288505] [2024-11-14 04:15:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:29,533 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 [2024-11-14 04:15:29,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:15:29,535 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:15:29,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:29,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 04:15:29,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:15:29,664 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 [2024-11-14 04:15:29,712 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 [2024-11-14 04:15:29,728 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 04:15:29,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 04:15:29,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:15:29,798 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 [2024-11-14 04:15:29,952 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 04:15:29,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-14 04:15:29,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-14 04:15:30,027 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 25 treesize of output 13 [2024-11-14 04:15:30,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 04:15:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:30,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:15:30,102 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:15:30,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879288505] [2024-11-14 04:15:30,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879288505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:30,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:30,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 04:15:30,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468606383] [2024-11-14 04:15:30,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:30,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 04:15:30,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:15:30,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 04:15:30,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-14 04:15:30,105 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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) [2024-11-14 04:15:31,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:31,729 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2024-11-14 04:15:31,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 04:15:31,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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 [2024-11-14 04:15:31,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:31,730 INFO L225 Difference]: With dead ends: 143 [2024-11-14 04:15:31,730 INFO L226 Difference]: Without dead ends: 143 [2024-11-14 04:15:31,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-14 04:15:31,731 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 138 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:31,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 253 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 04:15:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-14 04:15:31,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2024-11-14 04:15:31,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 134 states have internal predecessors, (146), 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) [2024-11-14 04:15:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2024-11-14 04:15:31,737 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 16 [2024-11-14 04:15:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:31,738 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2024-11-14 04:15:31,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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) [2024-11-14 04:15:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2024-11-14 04:15:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 04:15:31,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:31,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:31,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:31,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:31,939 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:31,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:31,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2139547561, now seen corresponding path program 1 times [2024-11-14 04:15:31,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:15:31,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324573013] [2024-11-14 04:15:31,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:31,940 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 [2024-11-14 04:15:31,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:15:31,942 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:15:31,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:32,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 04:15:32,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:15:32,125 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 04:15:32,126 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 22 [2024-11-14 04:15:32,329 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-14 04:15:32,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-14 04:15:32,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:15:32,715 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 04:15:32,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2024-11-14 04:15:32,805 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 43 treesize of output 27 [2024-11-14 04:15:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:33,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:15:33,079 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:15:33,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324573013] [2024-11-14 04:15:33,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324573013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:33,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:33,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 04:15:33,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358024454] [2024-11-14 04:15:33,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:33,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 04:15:33,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:15:33,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 04:15:33,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-14 04:15:33,081 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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) [2024-11-14 04:15:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:34,390 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2024-11-14 04:15:34,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 04:15:34,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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 [2024-11-14 04:15:34,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:34,392 INFO L225 Difference]: With dead ends: 151 [2024-11-14 04:15:34,392 INFO L226 Difference]: Without dead ends: 151 [2024-11-14 04:15:34,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-14 04:15:34,393 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 254 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:34,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 214 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 04:15:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-14 04:15:34,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 135. [2024-11-14 04:15:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 133 states have internal predecessors, (145), 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) [2024-11-14 04:15:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2024-11-14 04:15:34,398 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 16 [2024-11-14 04:15:34,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:34,398 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2024-11-14 04:15:34,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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) [2024-11-14 04:15:34,398 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2024-11-14 04:15:34,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 04:15:34,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:34,399 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:34,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 04:15:34,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:34,603 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:34,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:34,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1307399227, now seen corresponding path program 1 times [2024-11-14 04:15:34,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:15:34,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683922740] [2024-11-14 04:15:34,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:34,604 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 [2024-11-14 04:15:34,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:15:34,607 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:15:34,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:15:34,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 04:15:34,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:15:34,703 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 [2024-11-14 04:15:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:15:34,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:15:34,791 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:15:34,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683922740] [2024-11-14 04:15:34,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683922740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:34,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:15:34,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:15:34,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615501346] [2024-11-14 04:15:34,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:34,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:15:34,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:15:34,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:15:34,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:15:34,793 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2024-11-14 04:15:35,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:15:35,371 INFO L93 Difference]: Finished difference Result 176 states and 194 transitions. [2024-11-14 04:15:35,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:15:35,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2024-11-14 04:15:35,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:15:35,373 INFO L225 Difference]: With dead ends: 176 [2024-11-14 04:15:35,374 INFO L226 Difference]: Without dead ends: 176 [2024-11-14 04:15:35,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:15:35,374 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 60 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:15:35,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 278 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:15:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-14 04:15:35,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 139. [2024-11-14 04:15:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 107 states have (on average 1.3925233644859814) internal successors, (149), 137 states have internal predecessors, (149), 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) [2024-11-14 04:15:35,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2024-11-14 04:15:35,383 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 20 [2024-11-14 04:15:35,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:15:35,383 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2024-11-14 04:15:35,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2024-11-14 04:15:35,384 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2024-11-14 04:15:35,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 04:15:35,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:15:35,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:35,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:35,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:35,586 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 04:15:35,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:15:35,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1981374987, now seen corresponding path program 1 times [2024-11-14 04:15:35,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:15:35,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228713317] [2024-11-14 04:15:35,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:15:35,587 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 [2024-11-14 04:15:35,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:15:35,589 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:15:35,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:15:35,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:15:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:15:35,779 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2024-11-14 04:15:35,779 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:15:35,780 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (62 of 63 remaining) [2024-11-14 04:15:35,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 63 remaining) [2024-11-14 04:15:35,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 63 remaining) [2024-11-14 04:15:35,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 63 remaining) [2024-11-14 04:15:35,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 63 remaining) [2024-11-14 04:15:35,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 63 remaining) [2024-11-14 04:15:35,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 63 remaining) [2024-11-14 04:15:35,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 63 remaining) [2024-11-14 04:15:35,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 63 remaining) [2024-11-14 04:15:35,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 63 remaining) [2024-11-14 04:15:35,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 63 remaining) [2024-11-14 04:15:35,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 63 remaining) [2024-11-14 04:15:35,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 63 remaining) [2024-11-14 04:15:35,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 63 remaining) [2024-11-14 04:15:35,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 63 remaining) [2024-11-14 04:15:35,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 63 remaining) [2024-11-14 04:15:35,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 63 remaining) [2024-11-14 04:15:35,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 63 remaining) [2024-11-14 04:15:35,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 63 remaining) [2024-11-14 04:15:35,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 63 remaining) [2024-11-14 04:15:35,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 63 remaining) [2024-11-14 04:15:35,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 63 remaining) [2024-11-14 04:15:35,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 63 remaining) [2024-11-14 04:15:35,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 63 remaining) [2024-11-14 04:15:35,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 63 remaining) [2024-11-14 04:15:35,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 63 remaining) [2024-11-14 04:15:35,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 63 remaining) [2024-11-14 04:15:35,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 63 remaining) [2024-11-14 04:15:35,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 63 remaining) [2024-11-14 04:15:35,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 63 remaining) [2024-11-14 04:15:35,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 63 remaining) [2024-11-14 04:15:35,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 63 remaining) [2024-11-14 04:15:35,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 63 remaining) [2024-11-14 04:15:35,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 63 remaining) [2024-11-14 04:15:35,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 63 remaining) [2024-11-14 04:15:35,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 63 remaining) [2024-11-14 04:15:35,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 63 remaining) [2024-11-14 04:15:35,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 63 remaining) [2024-11-14 04:15:35,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 63 remaining) [2024-11-14 04:15:35,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 63 remaining) [2024-11-14 04:15:35,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 63 remaining) [2024-11-14 04:15:35,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 63 remaining) [2024-11-14 04:15:35,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 63 remaining) [2024-11-14 04:15:35,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 63 remaining) [2024-11-14 04:15:35,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 63 remaining) [2024-11-14 04:15:35,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 63 remaining) [2024-11-14 04:15:35,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 63 remaining) [2024-11-14 04:15:35,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 63 remaining) [2024-11-14 04:15:35,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 63 remaining) [2024-11-14 04:15:35,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (13 of 63 remaining) [2024-11-14 04:15:35,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (12 of 63 remaining) [2024-11-14 04:15:35,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (11 of 63 remaining) [2024-11-14 04:15:35,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 63 remaining) [2024-11-14 04:15:35,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 63 remaining) [2024-11-14 04:15:35,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (8 of 63 remaining) [2024-11-14 04:15:35,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE (7 of 63 remaining) [2024-11-14 04:15:35,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE (6 of 63 remaining) [2024-11-14 04:15:35,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 63 remaining) [2024-11-14 04:15:35,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 63 remaining) [2024-11-14 04:15:35,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (3 of 63 remaining) [2024-11-14 04:15:35,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE (2 of 63 remaining) [2024-11-14 04:15:35,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE (1 of 63 remaining) [2024-11-14 04:15:35,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK (0 of 63 remaining) [2024-11-14 04:15:35,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 04:15:35,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:15:35,995 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:15:36,020 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:15:36,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:15:36 BoogieIcfgContainer [2024-11-14 04:15:36,024 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:15:36,025 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:15:36,025 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:15:36,026 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:15:36,026 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:15:21" (3/4) ... [2024-11-14 04:15:36,029 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 04:15:36,030 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:15:36,031 INFO L158 Benchmark]: Toolchain (without parser) took 16093.39ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 59.2MB in the beginning and 38.6MB in the end (delta: 20.6MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-11-14 04:15:36,031 INFO L158 Benchmark]: CDTParser took 1.70ms. Allocated memory is still 83.9MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:15:36,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 660.15ms. Allocated memory is still 83.9MB. Free memory was 59.2MB in the beginning and 41.1MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 04:15:36,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.89ms. Allocated memory is still 83.9MB. Free memory was 41.1MB in the beginning and 39.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:15:36,032 INFO L158 Benchmark]: Boogie Preprocessor took 47.25ms. Allocated memory is still 83.9MB. Free memory was 39.0MB in the beginning and 37.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:15:36,032 INFO L158 Benchmark]: RCFGBuilder took 1247.03ms. Allocated memory is still 83.9MB. Free memory was 37.4MB in the beginning and 42.6MB in the end (delta: -5.2MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-14 04:15:36,033 INFO L158 Benchmark]: TraceAbstraction took 14063.79ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 42.2MB in the beginning and 38.6MB in the end (delta: 3.6MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-11-14 04:15:36,033 INFO L158 Benchmark]: Witness Printer took 5.06ms. Allocated memory is still 100.7MB. Free memory was 38.6MB in the beginning and 38.6MB in the end (delta: 12.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:15:36,035 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.70ms. Allocated memory is still 83.9MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 660.15ms. Allocated memory is still 83.9MB. Free memory was 59.2MB in the beginning and 41.1MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.89ms. Allocated memory is still 83.9MB. Free memory was 41.1MB in the beginning and 39.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.25ms. Allocated memory is still 83.9MB. Free memory was 39.0MB in the beginning and 37.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1247.03ms. Allocated memory is still 83.9MB. Free memory was 37.4MB in the beginning and 42.6MB in the end (delta: -5.2MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14063.79ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 42.2MB in the beginning and 38.6MB in the end (delta: 3.6MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Witness Printer took 5.06ms. Allocated memory is still 100.7MB. Free memory was 38.6MB in the beginning and 38.6MB in the end (delta: 12.9kB). 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: 991]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 991. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) VAL [list={6:0}] [L1007] list->prev = ((void*)0) VAL [list={6:0}] [L1008] list->colour = BLACK VAL [list={6:0}] [L1010] SLL* end = list; VAL [end={6:0}, list={6:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list VAL [end={6:0}, list={6:0}] [L1040] COND FALSE !(!(((void*)0) != end)) VAL [end={6:0}, list={6:0}] [L1041] EXPR end->colour VAL [end={6:0}, list={6:0}] [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end VAL [end={6:0}, list={6:0}] [L1045] EXPR end->colour VAL [end={6:0}, list={6:0}] [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next VAL [end={6:0}, list={6:0}] [L1051] COND TRUE !(end->next) [L1051] CALL reach_error() [L991] COND FALSE !(0) [L991] __assert_fail ("0", "dll-rb-cnstr_1-2.c", 11, __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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - 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: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: 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: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: 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, 143 locations, 63 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1112 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1112 mSDsluCounter, 2117 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1236 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2142 IncrementalHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 881 mSDtfsCounter, 2142 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=0, InterpolantAutomatonStates: 66, 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, 113 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 118 ConstructedInterpolants, 2 QuantifiedInterpolants, 1132 SizeOfPredicates, 29 NumberOfNonLiveVariables, 838 ConjunctsInSsa, 94 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 [2024-11-14 04:15:36,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c4d2bf-199e-4996-aaa1-6805b85f565f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample