./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_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_74681ed4-89d5-4720-93b9-2f790428f44f/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74681ed4-89d5-4720-93b9-2f790428f44f/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_74681ed4-89d5-4720-93b9-2f790428f44f/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74681ed4-89d5-4720-93b9-2f790428f44f/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74681ed4-89d5-4720-93b9-2f790428f44f/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_74681ed4-89d5-4720-93b9-2f790428f44f/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 ef47df31d033e531a0040913ad039c21826bf787c77c5128ceae3ef436a47b49 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:32:26,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:32:26,114 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74681ed4-89d5-4720-93b9-2f790428f44f/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 05:32:26,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:32:26,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:32:26,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:32:26,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:32:26,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:32:26,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:32:26,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:32:26,155 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:32:26,155 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:32:26,155 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:32:26,155 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:32:26,155 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:32:26,156 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:32:26,156 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:32:26,156 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:32:26,156 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:32:26,156 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:32:26,157 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:32:26,157 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:32:26,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:32:26,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:32:26,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:32:26,158 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:32:26,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:32:26,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:32:26,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:32:26,159 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:32:26,159 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:32:26,159 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:32:26,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:32:26,159 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:32:26,159 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:32:26,159 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:32:26,159 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:32:26,159 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:32:26,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:32:26,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:32:26,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:32:26,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:32:26,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:32:26,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:32:26,160 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:32:26,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:32:26,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:32:26,161 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:32:26,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:32:26,161 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_74681ed4-89d5-4720-93b9-2f790428f44f/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 -> ef47df31d033e531a0040913ad039c21826bf787c77c5128ceae3ef436a47b49 [2024-11-14 05:32:26,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:32:26,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:32:26,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:32:26,614 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:32:26,614 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:32:26,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74681ed4-89d5-4720-93b9-2f790428f44f/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i Unable to find full path for "g++" [2024-11-14 05:32:28,710 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:32:29,177 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:32:29,178 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74681ed4-89d5-4720-93b9-2f790428f44f/sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2024-11-14 05:32:29,201 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74681ed4-89d5-4720-93b9-2f790428f44f/bin/utaipan-verify-sOmjnqqW8E/data/cd5bc408c/6bbfa5af964e488f8f71a35f68516fab/FLAG7d374bc22 [2024-11-14 05:32:29,282 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74681ed4-89d5-4720-93b9-2f790428f44f/bin/utaipan-verify-sOmjnqqW8E/data/cd5bc408c/6bbfa5af964e488f8f71a35f68516fab [2024-11-14 05:32:29,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:32:29,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:32:29,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:32:29,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:32:29,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:32:29,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:32:29" (1/1) ... [2024-11-14 05:32:29,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1107d91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:29, skipping insertion in model container [2024-11-14 05:32:29,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:32:29" (1/1) ... [2024-11-14 05:32:29,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:32:29,780 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:32:29,781 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:32:29,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:32:29,807 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:32:29,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:32:29,918 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:32:29,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:29 WrapperNode [2024-11-14 05:32:29,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:32:29,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:32:29,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:32:29,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:32:29,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:29" (1/1) ... [2024-11-14 05:32:29,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:29" (1/1) ... [2024-11-14 05:32:29,982 INFO L138 Inliner]: procedures = 125, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-14 05:32:29,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:32:29,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:32:29,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:32:29,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:32:29,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:29" (1/1) ... [2024-11-14 05:32:29,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:29" (1/1) ... [2024-11-14 05:32:30,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:29" (1/1) ... [2024-11-14 05:32:30,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:29" (1/1) ... [2024-11-14 05:32:30,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:29" (1/1) ... [2024-11-14 05:32:30,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:29" (1/1) ... [2024-11-14 05:32:30,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:29" (1/1) ... [2024-11-14 05:32:30,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:29" (1/1) ... [2024-11-14 05:32:30,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:32:30,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:32:30,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:32:30,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:32:30,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:29" (1/1) ... [2024-11-14 05:32:30,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:32:30,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74681ed4-89d5-4720-93b9-2f790428f44f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:32:30,076 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74681ed4-89d5-4720-93b9-2f790428f44f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:32:30,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74681ed4-89d5-4720-93b9-2f790428f44f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:32:30,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:32:30,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:32:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:32:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:32:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:32:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:32:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:32:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:32:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:32:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:32:30,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:32:30,241 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:32:30,242 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:32:30,650 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-14 05:32:30,650 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:32:30,734 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:32:30,738 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 05:32:30,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:32:30 BoogieIcfgContainer [2024-11-14 05:32:30,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:32:30,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:32:30,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:32:30,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:32:30,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:32:29" (1/3) ... [2024-11-14 05:32:30,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3254cf36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:32:30, skipping insertion in model container [2024-11-14 05:32:30,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:29" (2/3) ... [2024-11-14 05:32:30,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3254cf36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:32:30, skipping insertion in model container [2024-11-14 05:32:30,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:32:30" (3/3) ... [2024-11-14 05:32:30,754 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1-2.i [2024-11-14 05:32:30,774 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:32:30,776 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0019_1-2.i that has 1 procedures, 60 locations, 1 initial locations, 0 loop locations, and 35 error locations. [2024-11-14 05:32:30,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:32:30,849 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;@10fa398c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:32:30,849 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-14 05:32:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 24 states have (on average 2.5) internal successors, (60), 59 states have internal predecessors, (60), 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 05:32:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 05:32:30,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:30,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 05:32:30,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:30,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash 3414, now seen corresponding path program 1 times [2024-11-14 05:32:30,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:30,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946677615] [2024-11-14 05:32:30,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:30,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:31,291 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 05:32:31,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:31,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946677615] [2024-11-14 05:32:31,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946677615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:31,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:31,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 05:32:31,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416604756] [2024-11-14 05:32:31,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:31,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:32:31,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:31,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:32:31,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:32:31,346 INFO L87 Difference]: Start difference. First operand has 60 states, 24 states have (on average 2.5) internal successors, (60), 59 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 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 05:32:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:31,514 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2024-11-14 05:32:31,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:32:31,517 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 05:32:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:31,524 INFO L225 Difference]: With dead ends: 56 [2024-11-14 05:32:31,524 INFO L226 Difference]: Without dead ends: 55 [2024-11-14 05:32:31,526 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 05:32:31,530 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:31,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 58 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:32:31,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-14 05:32:31,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-14 05:32:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 54 states have internal predecessors, (55), 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 05:32:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2024-11-14 05:32:31,567 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 2 [2024-11-14 05:32:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:31,568 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2024-11-14 05:32:31,568 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 05:32:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2024-11-14 05:32:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 05:32:31,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:31,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 05:32:31,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:32:31,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:31,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:31,570 INFO L85 PathProgramCache]: Analyzing trace with hash 3415, now seen corresponding path program 1 times [2024-11-14 05:32:31,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:31,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947368320] [2024-11-14 05:32:31,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:31,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:31,801 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 05:32:31,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:31,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947368320] [2024-11-14 05:32:31,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947368320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:31,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:31,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 05:32:31,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187308093] [2024-11-14 05:32:31,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:31,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:32:31,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:31,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:32:31,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:32:31,804 INFO L87 Difference]: Start difference. First operand 55 states and 55 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 05:32:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:31,918 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2024-11-14 05:32:31,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:32:31,921 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 05:32:31,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:31,922 INFO L225 Difference]: With dead ends: 51 [2024-11-14 05:32:31,922 INFO L226 Difference]: Without dead ends: 51 [2024-11-14 05:32:31,922 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 05:32:31,923 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:31,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:32:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-14 05:32:31,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-14 05:32:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 24 states have (on average 2.125) internal successors, (51), 50 states have internal predecessors, (51), 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 05:32:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-11-14 05:32:31,934 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 2 [2024-11-14 05:32:31,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:31,934 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-11-14 05:32:31,935 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 05:32:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-11-14 05:32:31,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 05:32:31,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:31,935 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 05:32:31,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:32:31,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:31,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:31,938 INFO L85 PathProgramCache]: Analyzing trace with hash 104172757, now seen corresponding path program 1 times [2024-11-14 05:32:31,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:31,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973564079] [2024-11-14 05:32:31,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:31,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:32,491 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 05:32:32,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:32,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973564079] [2024-11-14 05:32:32,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973564079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:32,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:32,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:32:32,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659789336] [2024-11-14 05:32:32,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:32,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:32:32,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:32,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:32:32,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:32:32,496 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:32:32,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:32,686 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2024-11-14 05:32:32,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:32:32,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-14 05:32:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:32,688 INFO L225 Difference]: With dead ends: 50 [2024-11-14 05:32:32,689 INFO L226 Difference]: Without dead ends: 50 [2024-11-14 05:32:32,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 05:32:32,691 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:32,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:32:32,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-14 05:32:32,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-14 05:32:32,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 49 states have internal predecessors, (50), 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 05:32:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2024-11-14 05:32:32,702 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 5 [2024-11-14 05:32:32,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:32,702 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2024-11-14 05:32:32,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:32:32,703 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2024-11-14 05:32:32,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 05:32:32,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:32,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 05:32:32,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:32:32,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:32,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:32,705 INFO L85 PathProgramCache]: Analyzing trace with hash 104172756, now seen corresponding path program 1 times [2024-11-14 05:32:32,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:32,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255439057] [2024-11-14 05:32:32,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:32,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:32,963 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 05:32:32,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:32,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255439057] [2024-11-14 05:32:32,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255439057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:32,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:32,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:32:32,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513426327] [2024-11-14 05:32:32,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:32,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:32:32,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:32,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:32:32,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:32:32,967 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:32:33,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:33,120 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2024-11-14 05:32:33,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:32:33,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-14 05:32:33,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:33,121 INFO L225 Difference]: With dead ends: 49 [2024-11-14 05:32:33,121 INFO L226 Difference]: Without dead ends: 49 [2024-11-14 05:32:33,121 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 05:32:33,122 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:33,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 94 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:32:33,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-14 05:32:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-14 05:32:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 48 states have internal predecessors, (49), 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 05:32:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2024-11-14 05:32:33,126 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 5 [2024-11-14 05:32:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:33,127 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2024-11-14 05:32:33,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:32:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2024-11-14 05:32:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 05:32:33,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:33,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:33,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:32:33,128 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:33,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:33,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1325830870, now seen corresponding path program 1 times [2024-11-14 05:32:33,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:33,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166215319] [2024-11-14 05:32:33,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:33,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:33,508 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 05:32:33,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:33,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166215319] [2024-11-14 05:32:33,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166215319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:33,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:33,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:32:33,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251261019] [2024-11-14 05:32:33,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:33,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:32:33,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:33,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:32:33,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:32:33,510 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 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 05:32:33,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:33,733 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2024-11-14 05:32:33,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:32:33,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 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 05:32:33,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:33,734 INFO L225 Difference]: With dead ends: 48 [2024-11-14 05:32:33,734 INFO L226 Difference]: Without dead ends: 48 [2024-11-14 05:32:33,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:32:33,735 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:33,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 125 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:32:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-14 05:32:33,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-14 05:32:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 24 states have (on average 2.0) internal successors, (48), 47 states have internal predecessors, (48), 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 05:32:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2024-11-14 05:32:33,743 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 7 [2024-11-14 05:32:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:33,743 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2024-11-14 05:32:33,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 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 05:32:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2024-11-14 05:32:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 05:32:33,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:33,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:33,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:32:33,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:33,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:33,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1325830871, now seen corresponding path program 1 times [2024-11-14 05:32:33,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:33,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675782789] [2024-11-14 05:32:33,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:33,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:34,311 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 05:32:34,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:34,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675782789] [2024-11-14 05:32:34,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675782789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:34,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:34,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:32:34,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793188383] [2024-11-14 05:32:34,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:34,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:32:34,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:34,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:32:34,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:32:34,313 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 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 05:32:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:34,475 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2024-11-14 05:32:34,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:32:34,476 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 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 05:32:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:34,477 INFO L225 Difference]: With dead ends: 47 [2024-11-14 05:32:34,477 INFO L226 Difference]: Without dead ends: 47 [2024-11-14 05:32:34,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:32:34,478 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:34,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:32:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-14 05:32:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-14 05:32:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 46 states have internal predecessors, (47), 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 05:32:34,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2024-11-14 05:32:34,483 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 7 [2024-11-14 05:32:34,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:34,483 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2024-11-14 05:32:34,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 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 05:32:34,483 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2024-11-14 05:32:34,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 05:32:34,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:34,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:34,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 05:32:34,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:34,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:34,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1848914102, now seen corresponding path program 1 times [2024-11-14 05:32:34,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:34,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057948174] [2024-11-14 05:32:34,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:34,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:34,607 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 05:32:34,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:34,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057948174] [2024-11-14 05:32:34,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057948174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:34,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:34,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:32:34,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536680380] [2024-11-14 05:32:34,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:34,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:32:34,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:34,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:32:34,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:32:34,610 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:32:34,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:34,741 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2024-11-14 05:32:34,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:32:34,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-14 05:32:34,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:34,742 INFO L225 Difference]: With dead ends: 45 [2024-11-14 05:32:34,742 INFO L226 Difference]: Without dead ends: 45 [2024-11-14 05:32:34,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:32:34,743 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:34,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 49 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:32:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-14 05:32:34,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-14 05:32:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 24 states have (on average 1.875) internal successors, (45), 44 states have internal predecessors, (45), 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 05:32:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2024-11-14 05:32:34,748 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 8 [2024-11-14 05:32:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:34,749 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2024-11-14 05:32:34,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:32:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2024-11-14 05:32:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 05:32:34,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:34,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:34,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 05:32:34,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:34,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:34,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1848914101, now seen corresponding path program 1 times [2024-11-14 05:32:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:34,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451472206] [2024-11-14 05:32:34,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:34,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:35,013 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 05:32:35,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:35,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451472206] [2024-11-14 05:32:35,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451472206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:35,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:35,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:32:35,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798605308] [2024-11-14 05:32:35,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:35,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:32:35,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:35,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:32:35,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:32:35,016 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:32:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:35,133 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2024-11-14 05:32:35,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:32:35,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-14 05:32:35,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:35,134 INFO L225 Difference]: With dead ends: 43 [2024-11-14 05:32:35,134 INFO L226 Difference]: Without dead ends: 43 [2024-11-14 05:32:35,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:32:35,135 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:35,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 105 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:32:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-14 05:32:35,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-14 05:32:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 42 states have internal predecessors, (43), 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 05:32:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2024-11-14 05:32:35,139 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 8 [2024-11-14 05:32:35,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:35,140 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2024-11-14 05:32:35,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:32:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2024-11-14 05:32:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:32:35,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:35,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:35,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 05:32:35,141 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:35,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:35,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1310010231, now seen corresponding path program 1 times [2024-11-14 05:32:35,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:35,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020845376] [2024-11-14 05:32:35,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:35,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:35,228 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 05:32:35,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:35,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020845376] [2024-11-14 05:32:35,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020845376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:35,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:35,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:32:35,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120558777] [2024-11-14 05:32:35,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:35,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:32:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:35,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:32:35,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:32:35,230 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 05:32:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:35,308 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2024-11-14 05:32:35,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:32:35,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-11-14 05:32:35,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:35,309 INFO L225 Difference]: With dead ends: 39 [2024-11-14 05:32:35,309 INFO L226 Difference]: Without dead ends: 39 [2024-11-14 05:32:35,310 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 05:32:35,310 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:35,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 22 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:32:35,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-14 05:32:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-14 05:32:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.625) internal successors, (39), 38 states have internal predecessors, (39), 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 05:32:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2024-11-14 05:32:35,315 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 10 [2024-11-14 05:32:35,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:35,315 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2024-11-14 05:32:35,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 05:32:35,315 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2024-11-14 05:32:35,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:32:35,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:35,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:35,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 05:32:35,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:35,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:35,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1310010232, now seen corresponding path program 1 times [2024-11-14 05:32:35,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:35,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231477366] [2024-11-14 05:32:35,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:35,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:35,448 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 05:32:35,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:35,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231477366] [2024-11-14 05:32:35,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231477366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:35,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:35,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:32:35,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323140026] [2024-11-14 05:32:35,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:35,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:32:35,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:35,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:32:35,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:32:35,451 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 05:32:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:35,541 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2024-11-14 05:32:35,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:32:35,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-11-14 05:32:35,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:35,543 INFO L225 Difference]: With dead ends: 35 [2024-11-14 05:32:35,543 INFO L226 Difference]: Without dead ends: 35 [2024-11-14 05:32:35,543 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 05:32:35,544 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:35,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 40 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:32:35,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-14 05:32:35,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-14 05:32:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 34 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:32:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-11-14 05:32:35,552 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 10 [2024-11-14 05:32:35,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:35,552 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2024-11-14 05:32:35,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 05:32:35,552 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-11-14 05:32:35,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 05:32:35,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:35,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:35,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 05:32:35,553 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:35,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:35,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1609003904, now seen corresponding path program 1 times [2024-11-14 05:32:35,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:35,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547667745] [2024-11-14 05:32:35,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:35,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:36,511 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 05:32:36,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:36,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547667745] [2024-11-14 05:32:36,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547667745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:36,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:36,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 05:32:36,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407710237] [2024-11-14 05:32:36,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:36,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:32:36,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:36,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:32:36,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:32:36,515 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 05:32:36,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:36,832 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2024-11-14 05:32:36,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 05:32:36,833 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 14 [2024-11-14 05:32:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:36,833 INFO L225 Difference]: With dead ends: 33 [2024-11-14 05:32:36,834 INFO L226 Difference]: Without dead ends: 33 [2024-11-14 05:32:36,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-14 05:32:36,835 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:36,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 92 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:32:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-14 05:32:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-14 05:32:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.375) internal successors, (33), 32 states have internal predecessors, (33), 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 05:32:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2024-11-14 05:32:36,838 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 14 [2024-11-14 05:32:36,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:36,838 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2024-11-14 05:32:36,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 05:32:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2024-11-14 05:32:36,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 05:32:36,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:36,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:36,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 05:32:36,840 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:36,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:36,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1609003903, now seen corresponding path program 1 times [2024-11-14 05:32:36,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:36,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315534040] [2024-11-14 05:32:36,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:36,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:38,214 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 05:32:38,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:38,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315534040] [2024-11-14 05:32:38,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315534040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:38,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:38,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 05:32:38,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520598613] [2024-11-14 05:32:38,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:38,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:32:38,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:38,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:32:38,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:32:38,219 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 05:32:38,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:38,623 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2024-11-14 05:32:38,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 05:32:38,624 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 14 [2024-11-14 05:32:38,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:38,624 INFO L225 Difference]: With dead ends: 32 [2024-11-14 05:32:38,624 INFO L226 Difference]: Without dead ends: 32 [2024-11-14 05:32:38,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-14 05:32:38,625 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:38,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 112 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:32:38,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-14 05:32:38,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-14 05:32:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:32:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2024-11-14 05:32:38,630 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 14 [2024-11-14 05:32:38,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:38,630 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2024-11-14 05:32:38,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 05:32:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2024-11-14 05:32:38,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 05:32:38,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:38,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:38,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 05:32:38,632 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:38,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:38,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1660486549, now seen corresponding path program 1 times [2024-11-14 05:32:38,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:38,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527350489] [2024-11-14 05:32:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:38,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:39,564 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 05:32:39,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:39,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527350489] [2024-11-14 05:32:39,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527350489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:39,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:39,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 05:32:39,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567580460] [2024-11-14 05:32:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:39,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:32:39,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:39,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:32:39,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:32:39,569 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 05:32:39,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:39,888 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2024-11-14 05:32:39,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:32:39,889 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 15 [2024-11-14 05:32:39,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:39,889 INFO L225 Difference]: With dead ends: 30 [2024-11-14 05:32:39,890 INFO L226 Difference]: Without dead ends: 30 [2024-11-14 05:32:39,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:32:39,891 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:39,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 81 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:32:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-14 05:32:39,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-14 05:32:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:32:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-11-14 05:32:39,897 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 15 [2024-11-14 05:32:39,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:39,897 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-11-14 05:32:39,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 05:32:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-11-14 05:32:39,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 05:32:39,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:39,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:39,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 05:32:39,899 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:39,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:39,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1660486550, now seen corresponding path program 1 times [2024-11-14 05:32:39,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:39,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983479205] [2024-11-14 05:32:39,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:39,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:41,071 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 05:32:41,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:41,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983479205] [2024-11-14 05:32:41,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983479205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:41,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:41,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 05:32:41,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505506958] [2024-11-14 05:32:41,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:41,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 05:32:41,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:41,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 05:32:41,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:32:41,073 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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 05:32:41,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:41,340 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2024-11-14 05:32:41,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:32:41,341 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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 15 [2024-11-14 05:32:41,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:41,342 INFO L225 Difference]: With dead ends: 29 [2024-11-14 05:32:41,342 INFO L226 Difference]: Without dead ends: 29 [2024-11-14 05:32:41,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:32:41,343 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:41,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 68 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:32:41,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-14 05:32:41,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-14 05:32:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 27 states have internal predecessors, (28), 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 05:32:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2024-11-14 05:32:41,347 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2024-11-14 05:32:41,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:41,347 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2024-11-14 05:32:41,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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 05:32:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2024-11-14 05:32:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 05:32:41,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:41,347 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 05:32:41,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 05:32:41,348 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:41,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:41,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1878507738, now seen corresponding path program 1 times [2024-11-14 05:32:41,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:41,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377314033] [2024-11-14 05:32:41,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:41,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:43,631 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 05:32:43,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:43,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377314033] [2024-11-14 05:32:43,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377314033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:43,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:43,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-14 05:32:43,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315208073] [2024-11-14 05:32:43,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:43,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 05:32:43,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:43,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 05:32:43,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2024-11-14 05:32:43,634 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 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 05:32:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:44,235 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2024-11-14 05:32:44,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:32:44,236 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 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 05:32:44,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:44,236 INFO L225 Difference]: With dead ends: 28 [2024-11-14 05:32:44,236 INFO L226 Difference]: Without dead ends: 28 [2024-11-14 05:32:44,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2024-11-14 05:32:44,239 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:44,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:32:44,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-14 05:32:44,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-14 05:32:44,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 27 states have internal predecessors, (27), 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 05:32:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2024-11-14 05:32:44,242 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 18 [2024-11-14 05:32:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:44,242 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2024-11-14 05:32:44,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 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 05:32:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2024-11-14 05:32:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 05:32:44,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:44,244 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 05:32:44,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 05:32:44,244 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:44,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:44,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1878506201, now seen corresponding path program 1 times [2024-11-14 05:32:44,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:44,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846926990] [2024-11-14 05:32:44,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:44,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:44,857 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 05:32:44,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:44,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846926990] [2024-11-14 05:32:44,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846926990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:44,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:44,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 05:32:44,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480994860] [2024-11-14 05:32:44,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:44,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:32:44,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:44,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:32:44,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:32:44,859 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 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 05:32:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:45,102 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2024-11-14 05:32:45,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 05:32:45,103 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 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 05:32:45,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:45,103 INFO L225 Difference]: With dead ends: 27 [2024-11-14 05:32:45,103 INFO L226 Difference]: Without dead ends: 27 [2024-11-14 05:32:45,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-14 05:32:45,104 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:45,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:32:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-14 05:32:45,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-14 05:32:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 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 05:32:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2024-11-14 05:32:45,115 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 18 [2024-11-14 05:32:45,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:45,115 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2024-11-14 05:32:45,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 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 05:32:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2024-11-14 05:32:45,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:32:45,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:45,116 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] [2024-11-14 05:32:45,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 05:32:45,116 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:45,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash 845726297, now seen corresponding path program 1 times [2024-11-14 05:32:45,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:45,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700462370] [2024-11-14 05:32:45,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:45,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:45,943 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 05:32:45,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:45,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700462370] [2024-11-14 05:32:45,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700462370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:45,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:45,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 05:32:45,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875039916] [2024-11-14 05:32:45,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:45,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 05:32:45,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:45,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 05:32:45,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:32:45,946 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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 05:32:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:46,159 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2024-11-14 05:32:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:32:46,160 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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 21 [2024-11-14 05:32:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:46,160 INFO L225 Difference]: With dead ends: 26 [2024-11-14 05:32:46,160 INFO L226 Difference]: Without dead ends: 26 [2024-11-14 05:32:46,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:32:46,161 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:46,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 45 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:32:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-14 05:32:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-14 05:32:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 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 05:32:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2024-11-14 05:32:46,164 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 21 [2024-11-14 05:32:46,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:46,165 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2024-11-14 05:32:46,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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 05:32:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2024-11-14 05:32:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:32:46,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:46,166 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 05:32:46,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 05:32:46,166 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:46,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:46,167 INFO L85 PathProgramCache]: Analyzing trace with hash 447711531, now seen corresponding path program 1 times [2024-11-14 05:32:46,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:46,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476033998] [2024-11-14 05:32:46,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:46,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:47,156 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 05:32:47,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:47,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476033998] [2024-11-14 05:32:47,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476033998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:47,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:47,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-14 05:32:47,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960405519] [2024-11-14 05:32:47,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:47,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 05:32:47,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:47,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 05:32:47,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-14 05:32:47,159 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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 05:32:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:47,469 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2024-11-14 05:32:47,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:32:47,470 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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 22 [2024-11-14 05:32:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:47,471 INFO L225 Difference]: With dead ends: 25 [2024-11-14 05:32:47,471 INFO L226 Difference]: Without dead ends: 25 [2024-11-14 05:32:47,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:32:47,472 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:47,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 43 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:32:47,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-14 05:32:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-14 05:32:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0) internal successors, (24), 24 states have internal predecessors, (24), 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 05:32:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2024-11-14 05:32:47,475 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 22 [2024-11-14 05:32:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:47,476 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2024-11-14 05:32:47,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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 05:32:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2024-11-14 05:32:47,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:32:47,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:47,478 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, 1, 1] [2024-11-14 05:32:47,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 05:32:47,479 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 05:32:47,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:47,479 INFO L85 PathProgramCache]: Analyzing trace with hash 754054958, now seen corresponding path program 1 times [2024-11-14 05:32:47,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:47,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97513773] [2024-11-14 05:32:47,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:47,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:50,783 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 05:32:50,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:50,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97513773] [2024-11-14 05:32:50,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97513773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:50,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:32:50,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-14 05:32:50,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138171005] [2024-11-14 05:32:50,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:50,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:32:50,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:50,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:32:50,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:32:50,786 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 05:32:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:51,683 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2024-11-14 05:32:51,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-14 05:32:51,684 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-14 05:32:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:51,684 INFO L225 Difference]: With dead ends: 24 [2024-11-14 05:32:51,684 INFO L226 Difference]: Without dead ends: 0 [2024-11-14 05:32:51,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2024-11-14 05:32:51,685 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:51,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 50 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:32:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-14 05:32:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-14 05:32:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 05:32:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-14 05:32:51,687 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2024-11-14 05:32:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:51,687 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-14 05:32:51,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 05:32:51,687 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-14 05:32:51,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-14 05:32:51,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 35 remaining) [2024-11-14 05:32:51,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 35 remaining) [2024-11-14 05:32:51,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 35 remaining) [2024-11-14 05:32:51,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 35 remaining) [2024-11-14 05:32:51,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 35 remaining) [2024-11-14 05:32:51,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 35 remaining) [2024-11-14 05:32:51,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 35 remaining) [2024-11-14 05:32:51,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 35 remaining) [2024-11-14 05:32:51,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 35 remaining) [2024-11-14 05:32:51,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 35 remaining) [2024-11-14 05:32:51,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 35 remaining) [2024-11-14 05:32:51,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 35 remaining) [2024-11-14 05:32:51,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 35 remaining) [2024-11-14 05:32:51,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 35 remaining) [2024-11-14 05:32:51,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 35 remaining) [2024-11-14 05:32:51,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 35 remaining) [2024-11-14 05:32:51,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 35 remaining) [2024-11-14 05:32:51,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 35 remaining) [2024-11-14 05:32:51,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 35 remaining) [2024-11-14 05:32:51,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 35 remaining) [2024-11-14 05:32:51,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 35 remaining) [2024-11-14 05:32:51,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 35 remaining) [2024-11-14 05:32:51,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 35 remaining) [2024-11-14 05:32:51,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 35 remaining) [2024-11-14 05:32:51,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 35 remaining) [2024-11-14 05:32:51,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 35 remaining) [2024-11-14 05:32:51,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 35 remaining) [2024-11-14 05:32:51,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 35 remaining) [2024-11-14 05:32:51,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE (6 of 35 remaining) [2024-11-14 05:32:51,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE (5 of 35 remaining) [2024-11-14 05:32:51,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE (4 of 35 remaining) [2024-11-14 05:32:51,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (3 of 35 remaining) [2024-11-14 05:32:51,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (2 of 35 remaining) [2024-11-14 05:32:51,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (1 of 35 remaining) [2024-11-14 05:32:51,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (0 of 35 remaining) [2024-11-14 05:32:51,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 05:32:51,701 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:51,703 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 05:32:51,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:32:51 BoogieIcfgContainer [2024-11-14 05:32:51,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 05:32:51,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 05:32:51,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 05:32:51,709 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 05:32:51,709 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:32:30" (3/4) ... [2024-11-14 05:32:51,712 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-14 05:32:51,723 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-11-14 05:32:51,723 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-14 05:32:51,724 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-14 05:32:51,724 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-14 05:32:51,816 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74681ed4-89d5-4720-93b9-2f790428f44f/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 05:32:51,816 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74681ed4-89d5-4720-93b9-2f790428f44f/bin/utaipan-verify-sOmjnqqW8E/witness.yml [2024-11-14 05:32:51,817 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 05:32:51,818 INFO L158 Benchmark]: Toolchain (without parser) took 22531.47ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 106.8MB in the beginning and 262.8MB in the end (delta: -156.0MB). Peak memory consumption was 183.7MB. Max. memory is 16.1GB. [2024-11-14 05:32:51,818 INFO L158 Benchmark]: CDTParser took 1.76ms. Allocated memory is still 167.8MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:32:51,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 633.90ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 89.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:32:51,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.52ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 88.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:32:51,819 INFO L158 Benchmark]: Boogie Preprocessor took 51.37ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 86.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:32:51,819 INFO L158 Benchmark]: RCFGBuilder took 702.91ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 66.2MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 05:32:51,820 INFO L158 Benchmark]: TraceAbstraction took 20963.98ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 65.9MB in the beginning and 266.9MB in the end (delta: -201.0MB). Peak memory consumption was 141.7MB. Max. memory is 16.1GB. [2024-11-14 05:32:51,820 INFO L158 Benchmark]: Witness Printer took 108.37ms. Allocated memory is still 486.5MB. Free memory was 266.9MB in the beginning and 262.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:32:51,822 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.76ms. Allocated memory is still 167.8MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 633.90ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 89.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.52ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 88.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.37ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 86.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 702.91ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 66.2MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 20963.98ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 65.9MB in the beginning and 266.9MB in the end (delta: -201.0MB). Peak memory consumption was 141.7MB. Max. memory is 16.1GB. * Witness Printer took 108.37ms. Allocated memory is still 486.5MB. Free memory was 266.9MB in the beginning and 262.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 540]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 540]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 541]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 541]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 541]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 543]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 20.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 1453 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1039 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2558 IncrementalHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 414 mSDtfsCounter, 2558 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, InterpolantAutomatonStates: 171, 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, 19 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 4226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-14 05:32:51,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74681ed4-89d5-4720-93b9-2f790428f44f/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: TRUE